Infinitary computability with infinite time Turing machines
From MaRDI portal
Cited in
(10)- Infinite time extensions of Kleene's \({\mathcal O}\)
- Weaker variants of infinite time Turing machines
- Zeno machines and hypercomputation
- Revision sequences and computers with an infinite amount of time
- P ≠ NP ∩ co-NP for Infinite Time Turing Machines
- A Survey of Infinite Time Turing Machines
- Is P = PSPACE for Infinite Time Turing Machines?
- Infinite time Turing machines
- scientific article; zbMATH DE number 1749140 (Why is no real title available?)
- Admissible orders for closed intervals of real numbers not based on the extremes of the intervals
This page was built for publication: Infinitary computability with infinite time Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717037)