Timeline for What's the simplest noncontroversial 2-state universal Turing machine?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2017 at 18:11 | comment | added | Marzio De Biasi | @CraigFeinstein: the Wolfram (2,3) TM is slightly different from usual TMs: it doesn't have an halting state and it requires and infinite non-repeating tape support. It cannot even be considered weakly universal (a weakly universal TM requires an infinite repeated pattern in both directions) | |
| Jul 4, 2017 at 16:40 | comment | added | Craig Feinstein | Reading that paper, it says that 2 state 3 symbol Turing machines have a decidable halting problem, so the Wolfram 2 state 3 symbol Turing machine cannot be universal. | |
| Feb 15, 2012 at 1:02 | comment | added | AlexC | Very useful link. Thanks. Looks like I may be best going for a (2, 18) machine. | |
| Feb 14, 2012 at 20:46 | history | edited | Marzio De Biasi | CC BY-SA 3.0 |
link corrected
|
| Feb 14, 2012 at 20:06 | comment | added | Jeffε | The link goes to Alex Smith's paper, not the paper I think you intended. | |
| Feb 14, 2012 at 18:40 | history | edited | Marzio De Biasi | CC BY-SA 3.0 |
picture
|
| Feb 14, 2012 at 18:33 | history | answered | Marzio De Biasi | CC BY-SA 3.0 |