Timeline for Automatically a Knight, Knave, and Joker
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 2, 2015 at 9:24 | history | edited | Gamow |
edited tags
|
|
| Dec 30, 2014 at 15:10 | history | edited | McMagister |
edited tags
|
|
| Nov 14, 2014 at 23:49 | vote | accept | COTO | ||
| Nov 13, 2014 at 19:40 | answer | added | Lopsy | timeline score: 14 | |
| Nov 13, 2014 at 19:14 | comment | added | COTO | @EnvisionAndDevelop: Regarding the "cromulent", you're absolutely right. It behaves consistently, we just don't know which way. | |
| Nov 13, 2014 at 19:12 | comment | added | COTO | @EnvisionAndDevelop: It can be based on output if so desired. It has to be, since the output is the only thing that can be used to determine when to stop sending inputs. | |
| Nov 13, 2014 at 19:10 | comment | added | TheRubberDuck | Hmm. does the input have to be given all at once, or can we change the input based on partial output? | |
| Nov 13, 2014 at 19:09 | history | edited | COTO | CC BY-SA 3.0 |
added 31 characters in body
|
| Nov 13, 2014 at 19:07 | comment | added | COTO | @ch3ka: No. We only know that M is finite. | |
| Nov 13, 2014 at 19:05 | answer | added | TheRubberDuck | timeline score: 4 | |
| Nov 13, 2014 at 18:59 | comment | added | ch3ka |
Do we know M?
|
|
| Nov 13, 2014 at 18:39 | comment | added | TheRubberDuck | This whole cromulent day business... Are you just saying "it behaves consistently, but we don't know which way"? | |
| Nov 13, 2014 at 18:37 | comment | added | COTO |
@JoeZ.: You can't program the solution to this, unfortunately. The algorithm would take a lifetime to terminate even for modest M. You are correct in observing that it is a computer science puzzle, however. ;)
|
|
| Nov 13, 2014 at 18:35 | comment | added | user88 | This feels like a PCG problem, but stated in non-programming terms. | |
| Nov 13, 2014 at 18:30 | history | asked | COTO | CC BY-SA 3.0 |