Infinite time Turing machine: Difference between revisions
no edit summary
No edit summary |
RhubarbJayde (talk | contribs) No edit summary |
||
Line 13:
<nowiki>This further shows the computational potency of ITTMs, since the limit of the order-types of well-orders they can compute is much greater than that of normal TMs, i.e. \(\omega_1^{\mathrm{CK}}\).</nowiki>
Infinite time Turing machines can themselves be generalized further to \(\Sigma_n\)-machines, with \(\Sigma_2\)-machines being the same as the original.<ref>Friedman, Sy-David & Welch, P. D. (2011). Hypermachines. Journal of Symbolic Logic</ref>
| |||