= 27d567bc2d48d9f40e9ccc20ea370b15)
solipsist comments on Open Thread March 31 - April 7 2014 - Less Wrong Discussion
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (234)
Puzzle:
A countable infinity of prisoners are placed in a room so that they can all see each other, but are not allowed to communicate in any way and cannot see their own heads. The warden places on the head of each prisoner a red hat or a black hat. The prisoners will each guess the color of their own hat. They will all be released if at most finitely many of them guess incorrectly, and they will all be killed otherwise. The prisoners know all of this, and may collude beforehand. The prisoners are all distinguishable - think of them as being numbered 1,2,3,.... Again, once the warden has placed the hats, the prisoners receive no information other than the color of their fellow prisoners' hats. Prove that there is a strategy that guarantees a win for the prisoners.
(On my honor, this is possible.)
The participants have to base their decision on a non-measurable "events", right? The guessing procedure ends up as contorted as the slices in Tarski and Banach's sphere?
Right.