Timeline for How large is the supremum of halting times of Infinite Time Turing Machines, assuming that halting times are bounded and inputs are arbitrary?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 9, 2022 at 13:14 | comment | added | CSW | Theorem 4.5. By Definition 1.2. the ordinal $\tau$ in that theorem is as in the post of Dmytro Taranovsky. | |
| May 9, 2022 at 11:44 | comment | added | Michael Albanese | Which result in the paper addresses the question? | |
| May 9, 2022 at 11:06 | review | Late answers | |||
| May 9, 2022 at 11:44 | |||||
| S May 9, 2022 at 10:44 | review | First answers | |||
| May 9, 2022 at 10:55 | |||||
| S May 9, 2022 at 10:44 | history | answered | CSW | CC BY-SA 4.0 |