Timeline for Turing machines that read the entire program tape
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jul 15, 2011 at 18:36 | comment | added | Joel David Hamkins | Theorem 3 in the linked paper is exactly the claim that for any fixed input the asymptotic probability one behavior of a Turing machine (in this one-way infinite tape model) is that the head falls off the tape. | |
| Jul 15, 2011 at 18:01 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |