Timeline for Turing machines that always halt
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 22, 2022 at 7:16 | history | edited | CommunityBot |
replaced http://front.math.ucdavis.edu/ with https://arxiv.org/abs/
|
|
| Sep 30, 2016 at 22:38 | answer | added | Joshua Grochow | timeline score: 2 | |
| Sep 12, 2013 at 2:05 | history | edited | user6976 | CC BY-SA 3.0 |
added 81 characters in body
|
| Oct 5, 2011 at 19:10 | vote | accept | CommunityBot | moved from User.Id=6976 by developer User.Id=69903 | |
| Oct 3, 2011 at 21:35 | answer | added | user6976 | timeline score: 10 | |
| Oct 3, 2011 at 20:29 | comment | added | Gerhard Paseman | Short answer: I don't know. Long answer: There is a book on computability (author's name something like Hans Hermes?) which goes through various models of computability and shows their equivalence. It also has a section on Fitch's two variable model. Odds are reasonable that a book that has your model also has a citation to Hermes' book. Piergiorgio Oddifreddi also has a comprehensive intro to recursion theory. I suggest asking him or his book about where to find such a model in the classic literature. Gerhard "Ask Me About System Design" Paseman, 2011.10.03 | |
| Oct 3, 2011 at 19:51 | history | edited | user6976 | CC BY-SA 3.0 |
question rewritten; added 15 characters in body
|
| Oct 3, 2011 at 17:05 | comment | added | Jacques Carette | I would recommend that you post this at cstheory.stackexchange.com, where there is a higher concentration of experts on that particular topic. | |
| Oct 3, 2011 at 14:10 | history | asked | user6976 | CC BY-SA 3.0 |