Timeline for Gödel's speed up theorem and Matiyasevich polynomials
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 28, 2014 at 20:09 | answer | added | Joel David Hamkins | timeline score: 4 | |
| Apr 28, 2014 at 18:54 | comment | added | Feldmann Denis | Well, if I have a proof in ZFC that there exist k such that f(k)=0 (where f is recursive),I have usually no way to exhibit such a k (so long as I have no bound for it). But in the particular case of P, I would suspect an explicit bound exists (but it should be much higher than $10^{10^{100}}$) | |
| Apr 28, 2014 at 18:26 | comment | added | Joel David Hamkins | Regarding (c), what would it mean for a particular natural number k to not be computable? Every natural number is computable. | |
| Apr 28, 2014 at 18:15 | history | asked | Feldmann Denis | CC BY-SA 3.0 |