Timeline for How do I prove that all primitive recursive functions are computable?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 28, 2016 at 18:18 | comment | added | Raphael | There is no need to invoke the CTT here, since we can easily have a true proof. | |
| Mar 28, 2016 at 17:55 | comment | added | Yuval Filmus | No, you use the Church-Turing thesis to just present an informal algorithm. You can find many examples in any textbook on computability theory (aka recursion theory). | |
| Mar 28, 2016 at 17:53 | comment | added | user48566 | So do I need to provide a definition of TM that computes those functions? | |
| Mar 28, 2016 at 17:43 | history | answered | Yuval Filmus | CC BY-SA 3.0 |