Timeline for Verification of Turing-equivalent automata
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 27, 2017 at 12:07 | comment | added | Hauke Reddmann | (Now 27?) Wow. The Blog answers much more than I even asked. I wonder if verification tools for concrete Turing automata exist (analogous to the situation with higher Petri nets). | |
| Apr 27, 2017 at 11:59 | vote | accept | Hauke Reddmann | ||
| Apr 26, 2017 at 22:51 | comment | added | Joseph O'Rourke | @WillSawin: 43 states! Amazing. | |
| Apr 26, 2017 at 22:02 | comment | added | Will Sawin | Shorter Turing machines with similar properties along the same lines are now known, including a 43-state machine which halts if and only if there is a counterexample to Goldbach's conjecture, see scottaaronson.com/blog/?p=2741 | |
| Apr 26, 2017 at 21:33 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Typo.
|
| Apr 26, 2017 at 17:18 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Added link.
|
| Apr 26, 2017 at 15:11 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |