Timeline for Smallest base to reach partial recursive functions as a closure of unbound search
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot | replaced http://math.stackexchange.com/ with https://math.stackexchange.com/ | |
| May 6, 2013 at 13:04 | comment | added | Asaf Karagila♦ | Joel, thank you for your comment. I edited accordingly. | |
| May 6, 2013 at 13:03 | history | edited | Asaf Karagila♦ | CC BY-SA 3.0 | added 140 characters in body |
| May 6, 2013 at 12:52 | comment | added | user10891 | Thank you. I was not expecting an answer from this perspective so I need to think both the question and the answer a bit further. | |
| May 6, 2013 at 12:47 | comment | added | Joel David Hamkins | It is not correct to say that "every $\Delta_0$ function is primitive recursive", since there are functions whose graphs are $\Delta_0$, but which are not primitive recursive. These include some very fast-growing functions and there have been a few MO questions about this. Meanwhile, it is true to say that every $\Delta_0$ relation is primitive recursive. | |
| May 6, 2013 at 12:41 | comment | added | Asaf Karagila♦ | Frank, I edited the answer to add those. | |
| May 6, 2013 at 12:40 | history | edited | Asaf Karagila♦ | CC BY-SA 3.0 | added 706 characters in body |
| May 6, 2013 at 12:38 | comment | added | user10891 | What are these two $\Delta_0$ functions that we can go with? | |
| May 6, 2013 at 12:29 | history | answered | Asaf Karagila♦ | CC BY-SA 3.0 |