• No results found

Unanswerable questions and exploding god-heads

In document Recreational Math (Page 59-62)

In A simple solution to the hardest logic puzzle ever,[2] B. Rabern and L. Rabern develop the puzzle further by pointing out that it is not the case that 'ja' and 'da' are the only possible answers a god can give. It is also possible for a god to be unable to answer at all. For example, if the question "Are you going to answer this question with the word that means no in your language?" is put to True, he cannot answer truthfully. (The paper represents this as his head exploding, "...they are infallible gods! They have but one recourse – their heads explode.") Allowing the

"exploding head" case gives yet another solution of the puzzle and introduces the possibility of solving the puzzle (modified and original) in just two questions rather than three. In support of a two-question solution to the puzzle,

The Hardest Logic Puzzle Ever 53

the authors solve a similar simpler puzzle using just two questions.

• Three gods A, B, and C are called, in some order, Zephyr, Eurus, and Aeolus. The gods always speak truly.

Your task is to determine the identities of A, B, and C by asking yes-no questions; each question must be put to exactly one god. The gods understand English and will answer in English.

Note that this puzzle is trivially solved with three questions. Furthermore, to solve the puzzle in two questions, the following lemma is proved.

Tempered Liar Lemma. If we ask A "Is it the case that {[(you are going to answer 'no' to this question) AND (B is Zephyr)] OR (B is Eurus) }?", a response of 'yes' indicates that B is Eurus, a response of 'no' indicates that B is Aeolus, and an exploding head indicates that B is Zephyr. Hence we can determine the identity of B in one question.

Using this lemma it is simple to solve the puzzle in two questions. Rabern and Rabern (2008) use a similar trick (tempering the liar's paradox) to solve the original puzzle in just two questions. In ``How to solve the hardest logic puzzle ever in two questions" G. Uzquiano uses these techniques to provide a two question solution to the amended puzzle.[4][5] Two question solutions to both the original and amended puzzle take advantage of the fact that some gods have an inability to answer certain questions. Neither True nor False can provide an answer to the following question.

• Would you answer the same as Random would to the question `Is Dushanbe in Kirghizia?'?

Since the amended Random answers in a truly random manner, neither True nor False can predict whether Random would answer `ja' or `da' to the question of whether Dushanbe is in Kirghizia. Given this ignorance they will be unable to tell the truth or lie -- they will therefore remain silent. Random, however, who spouts random nonsense, will have no problem spouting off either `ja' or `da'. Uzquiano (2010) exploits this asymmetry to provide a two question solution to the modified puzzle. Yet, one might assume that the gods have an ``oracular ability to predict Random's answers even before the coin flip in Random’s brain?"[4] In this case, a two question solution is still available by using self‐referential questions of the style employed in Rabern and Rabern (2008).

• Would you answer `ja' to the question of whether you would answer `da' to this question?

Here again neither True nor False are able to answer this question given their commitments of truth-telling and lying, respectively. They are forced to answer`ja' just in case the answer they are committed to give is `da' and this they cannot do. Just as before they will suffer a head explosion. In contrast, Random will mindlessly spout his nonsense and randomly answer `ja' or `da'. Uzquiano (2010) also uses this asymmetry to provide a two question solution to the modified puzzle.[4][5]

• George Boolos, The hardest logic puzzle ever (The Harvard Review of Philosophy, 6:62–65, 1996).

• T.S. Roberts, Some thoughts about the hardest logic puzzle ever (Journal of Philosophical Logic 30:609–612(4), December 2001).

• Brian Rabern and Landon Rabern, A simple solution to the hardest logic puzzle ever (Analysis 68(2), 105–112, April 2008).

• Gabriel Uzquiano, How to solve the hardest logic puzzle ever in two questions, (Analysis 70(1), 39-44, January 2010).

The Hardest Logic Puzzle Ever 54

• Raymond Smullyan, What is the Name of This Book? (Prentice Hall, Englewood Cliffs, NJ, 1978).

• Raymond Smullyan, The Riddle of Sheherazade (A. A. Knopf, Inc., New York, 1997).

External links

• George Boolos. The hardest logic puzzle ever. The Harvard Review of Philosophy, 6:62–65, 1996. [6]

• T.S. Roberts. Some thoughts about the hardest logic puzzle ever. Journal of Philosophical Logic, 30:609–612(4), December 2001. [7]

• Brian Rabern and Landon Rabern. A simple solution to the hardest logic puzzle ever. Analysis 68 (298), 105–112, April 2008. [8]

• Tom Ellis. Even harder than the hardest logic puzzle ever. [9]

• Cher Stewart. Slightly harder than the hardest logic puzzle ever. [10]

• Brian Rabern and Landon Rabern. In defense of the two question solution to the hardest logic puzzle ever. [11]

• Gabriel Uzquiano. How to solve the hardest logic puzzle ever in two questions. [12]

• Walter Carnielli. Contrafactuais, contradição e o enigma lógico mais difícil do mundo. Revista Omnia Lumina.

[13]

References

[1] George Boolos, The Hardest Logic Puzzle Ever (Harvard Review of Philosophy, 6:62-65, 1996).

[2] Brian Rabern and Landon Rabern, A simple solution to the hardest logic puzzle ever, (Analysis 68 (298), 105–112, April 2008).

[3] T.S. Roberts, Some thoughts about the hardest logic puzzle ever (Journal of Philosophical Logic 30:609–612(4), December 2001).

[4] Gabriel Uzquiano. How to solve the hardest logic puzzle ever in two questions, (Analysis 70(1), 39-44, January 2010).

[5] Brian Rabern and Landon Rabern. "In defense of the two question solution to the hardest logic puzzle ever", (unpublished).

[6] http://www.hcs.harvard.edu/~hrp/issues/1996/Boolos.pdf [7] http://www.springerlink.com/content/v43v5431h2324888/

[8] http://www.blackwell-synergy.com/doi/abs/10.1111/j.1467-8284.2007.00723.x [9] http://www.srcf.ucam.org/~te233/maths/puzzles/evenharder.html

[10] http://edu.cherstewart.com/slightly_harder_than_the_hardest_logic_puzzle_ever.html [11] http://philrsss.anu.edu.au/~brian/defense_HLPE.pdf

[12] http://users.ox.ac.uk/%7Esfop0198/Three%20Gods.pdf [13] http://www.revistaomnialumina.com/?p=57

In document Recreational Math (Page 59-62)

Related documents