Timeline for Uncountable time Turing machines
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2014 at 17:59 | comment | added | Miha Habič | @Wojowu Yes, the arXiv version is a bit out of date. At one point Anton Pertun showed me an argument, based on the one you pointed to, which solved this question, among other things. And even before that Bob Lubarsky gave a more complicated solution. | |
| May 29, 2014 at 14:02 | vote | accept | Wojowu | ||
| May 29, 2014 at 14:02 | comment | added | Wojowu | In your paper, you put the question "does $\Sigma=\Sigma_C$?". This is false, because $\Sigma$ is computable from $0^\blacktriangledown$, as shown by Welch here (it's proven in proof of Corollary 3.6) | |
| May 29, 2014 at 13:59 | comment | added | Wojowu | After re-thinking my argument, I have realized where it fails. Namely, we cannot clock things like $\omega_1^2$, so we can't know if the simulation of machine with $0^\blacktriangledown$ has already made enough steps so that it will never halt. | |
| May 29, 2014 at 13:51 | history | answered | Miha Habič | CC BY-SA 3.0 |