Timeline for Can all lengths of shortest non-halting inputs of all Turing machines be limited by the Busy Beaver applied to the corresponding numbers of states?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9, 2018 at 4:50 | vote | accept | lyrically wicked | ||
| Apr 7, 2018 at 10:59 | history | edited | lyrically wicked | CC BY-SA 3.0 |
added 20 characters in body
|
| Apr 5, 2018 at 11:43 | answer | added | Adam P. Goucher | timeline score: 3 | |
| Apr 5, 2018 at 10:49 | answer | added | SSequence | timeline score: 2 | |
| Apr 4, 2018 at 6:41 | history | edited | lyrically wicked | CC BY-SA 3.0 |
added 36 characters in body
|
| Apr 4, 2018 at 6:23 | history | edited | lyrically wicked | CC BY-SA 3.0 |
edited title
|
| Apr 4, 2018 at 6:21 | review | First posts | |||
| Apr 4, 2018 at 6:21 | |||||
| Apr 4, 2018 at 6:17 | history | asked | lyrically wicked | CC BY-SA 3.0 |