Difference between revisions of "Talk:Blue Eyes"

Explain xkcd: It's 'cause you're dumb.
Jump to: navigation, search
Line 1: Line 1:
 
Is it really incomplete on the grounds that Joel hasn't be identified?  Explanations of comics 57-59 leave no more explanation of "Scott" than that he appears to be Randall's friend.  The fact that we don't have a last name for him doesn't make either [[Scott]] or those comic explanations incomplete.  Similarly, not have a full identifier for "Joel" in this one doesn't, in my opinion, warrant an incomplete tag.  I'm removing the tag.  If anyone object, revert it. [[User:Djbrasier|Djbrasier]] ([[User talk:Djbrasier|talk]]) 19:22, 22 May 2015 (UTC)
 
Is it really incomplete on the grounds that Joel hasn't be identified?  Explanations of comics 57-59 leave no more explanation of "Scott" than that he appears to be Randall's friend.  The fact that we don't have a last name for him doesn't make either [[Scott]] or those comic explanations incomplete.  Similarly, not have a full identifier for "Joel" in this one doesn't, in my opinion, warrant an incomplete tag.  I'm removing the tag.  If anyone object, revert it. [[User:Djbrasier|Djbrasier]] ([[User talk:Djbrasier|talk]]) 19:22, 22 May 2015 (UTC)
  
The proof for this puzzle is incomplete, if not wrong. The theorem is too weak, and the first inductive step does not hold. It should be: "Theorem: N blue eyed people with Nth order knowledge of all N people being logicians, N people having blue eyes, and any blue eyed person will leave as soon as possible after deducing they have blue eyes, will be able to leave on the Nth day." This may seem pedantic, but it really gets to the heart of the problem, which is trying to illustrate the use of orders of knowledge. In the theorem as stated, just N blue eyed people will leave on the Nth day, the first step does not hold. You need to further assume both that the person is a logician, and they have first order knowledge of someone having blue eyes, and will leave as soon as they figure that out, to make the first inductive step, all three of which are not in the hypothesis. In the correctly stated hypothesis, you then need to show that N + 1 people with (N+1)th order knowledge of all those things can deduce that the N people would leave if it was just them, and further that N+1 people have (N+1)th order knowledge of all these things. This is very important, and holds true (Since N+1th order knowledge is equivalent to knowing the N people have the Nth order knowledge necessary to fulfill the hypothesis, and by symmetry if the N logicians can figure it out the (N+1)th can too. Also, they have (N+1)th order knowledge of people leaving as soon as they can and everyone being a logician since in the proper statement of the puzzle it should be noted this is common knowledge, and the guru makes the knowledge of someone having blue eyes common knowledge.). Then you have a full proof, since you have now included for the base case that the first person is a logician, who knows someone has blue eyes, and will leave as soon as he can. Again, this may seem pedantic, but is really necessary both to be correct and as it illustrates the key of the puzzle, namely the guru gives 100th order knowledge of someone having blue eyes (this is the main problem people have, realizing the concrete piece of information the guru gives). [[User:Jlangy|Jlangy]] ([[User talk:Jlangy|talk]]) 23:53, 8 July 2015
+
The proof for this puzzle is incomplete, if not wrong. The theorem is too weak, it should be: "Theorem: N blue eyed people with Nth order knowledge of all N people being logicians, N people having blue eyes, and any blue eyed person will leave as soon as possible after deducing they have blue eyes, will be able to leave on the Nth day." This may seem pedantic, but it really gets to the heart of the problem, which is trying to illustrate the use of orders of knowledge. In the theorem as stated, just N blue eyed people will leave on the Nth day, the proof for the inductive steps does not hold. You need to further assume that the person is able to deduce the hypothesis (which should be proven). In other words, you say X-1 people would leave on the (X-1)th day by hypothesis, so the Xth person knows he can leave on the Xth day. But you did not prove that the Xth person can actually deduce this, namely that he has all the information necessary to do so. In the correctly stated hypothesis, you then need to show that N + 1 people with (N+1)th order knowledge of all those things can deduce that the N people would leave if it was just them, and further that N+1 people have (N+1)th order knowledge of all these things. This is very important, and holds true (Since N+1th order knowledge is equivalent to knowing the N people have the Nth order knowledge necessary to fulfill the hypothesis, and by symmetry if the N logicians can figure it out the (N+1)th can too. Also, they have (N+1)th order knowledge of people leaving as soon as they can and everyone being a logician since in the proper statement of the puzzle it should be noted this is common knowledge, and the guru makes the knowledge of someone having blue eyes common knowledge.). Then you have a full proof, since you have now included that they can actually deduce the inductive step. Again, this may seem pedantic, but is really necessary both to be correct and as it illustrates the key of the puzzle, namely the guru gives 100th order knowledge of someone having blue eyes (this is the main problem people have, realizing the concrete piece of information the guru gives). [[User:Jlangy|Jlangy]] ([[User talk:Jlangy|talk]]) 23:53, 8 July 2015

Revision as of 04:30, 9 July 2015

Is it really incomplete on the grounds that Joel hasn't be identified? Explanations of comics 57-59 leave no more explanation of "Scott" than that he appears to be Randall's friend. The fact that we don't have a last name for him doesn't make either Scott or those comic explanations incomplete. Similarly, not have a full identifier for "Joel" in this one doesn't, in my opinion, warrant an incomplete tag. I'm removing the tag. If anyone object, revert it. Djbrasier (talk) 19:22, 22 May 2015 (UTC)

The proof for this puzzle is incomplete, if not wrong. The theorem is too weak, it should be: "Theorem: N blue eyed people with Nth order knowledge of all N people being logicians, N people having blue eyes, and any blue eyed person will leave as soon as possible after deducing they have blue eyes, will be able to leave on the Nth day." This may seem pedantic, but it really gets to the heart of the problem, which is trying to illustrate the use of orders of knowledge. In the theorem as stated, just N blue eyed people will leave on the Nth day, the proof for the inductive steps does not hold. You need to further assume that the person is able to deduce the hypothesis (which should be proven). In other words, you say X-1 people would leave on the (X-1)th day by hypothesis, so the Xth person knows he can leave on the Xth day. But you did not prove that the Xth person can actually deduce this, namely that he has all the information necessary to do so. In the correctly stated hypothesis, you then need to show that N + 1 people with (N+1)th order knowledge of all those things can deduce that the N people would leave if it was just them, and further that N+1 people have (N+1)th order knowledge of all these things. This is very important, and holds true (Since N+1th order knowledge is equivalent to knowing the N people have the Nth order knowledge necessary to fulfill the hypothesis, and by symmetry if the N logicians can figure it out the (N+1)th can too. Also, they have (N+1)th order knowledge of people leaving as soon as they can and everyone being a logician since in the proper statement of the puzzle it should be noted this is common knowledge, and the guru makes the knowledge of someone having blue eyes common knowledge.). Then you have a full proof, since you have now included that they can actually deduce the inductive step. Again, this may seem pedantic, but is really necessary both to be correct and as it illustrates the key of the puzzle, namely the guru gives 100th order knowledge of someone having blue eyes (this is the main problem people have, realizing the concrete piece of information the guru gives). Jlangy (talk) 23:53, 8 July 2015