Timeline for What is the shortest program for which halting is unknown?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21 at 11:51 | comment | added | C7X | The halting status of all $5$-state Turing machines is now known, after having been resolved by the bbchallenge project earlier this month. | |
| Jun 29, 2010 at 19:07 | history | edited | Richard Stanley | CC BY-SA 2.5 |
edited body
|
| Jun 29, 2010 at 19:05 | comment | added | Daniel Litt | Ah, fair enough. That answers original question to my satisfaction, though if someone wants to address the "descriptive language" question and the reference request, that would also be great. | |
| Jun 29, 2010 at 19:05 | vote | accept | Daniel Litt | ||
| Jun 29, 2010 at 19:04 | comment | added | Antonio E. Porreca | Daniel: yes, since S(n) is known for n = 4. | |
| Jun 29, 2010 at 18:57 | comment | added | Daniel Litt | This does seem like a good contender. Is the halting status of every 4-state, 2-symbol machine known? | |
| Jun 29, 2010 at 18:52 | history | answered | Richard Stanley | CC BY-SA 2.5 |