Timeline for Existence of a set of valid Busy-Beaver entries.
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 23, 2011 at 16:56 | vote | accept | Saran Neti | ||
| Jun 23, 2011 at 16:53 | comment | added | Saran Neti | @Joel Thanks! Your statement "...stronger and stronger theories may prove higher and higher lower bounds..." and mhum's comment that non-countable should be rejected, point to an analogy. In Calculus class, I had a similar problem understanding the $\epsilon$, $\delta$ definition of the limit of a real valued function - which now seems intuitively obvious. Given an $\epsilon > 0$, I should be able to come up with a computably axiomatized theory that proves a lower bound for BB(n) to within that $\epsilon$ | |
| Jun 23, 2011 at 16:22 | vote | accept | Saran Neti | ||
| Jun 23, 2011 at 16:56 | |||||
| Jun 23, 2011 at 2:31 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 402 characters in body
|
| Jun 23, 2011 at 1:20 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |