The computational strengths of \(\alpha\)-tape infinite time Turing machines

DOI10.1016/j.apal.2014.04.016zbMath1352.03046OpenAlexW1990176504MaRDI QIDQ2453073

Benjamin G. Rin

Publication date: 6 June 2014

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2014.04.016

zbMATH Keywords

transfinite computationsupertaskordinal computabilityinfinite-time Turing machine

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computation over the reals, computable analysis (03D78)

Related Items

Realisability for infinitary intuitionistic set theory ⋮ Koepke machines and satisfiability for infinitary propositional languages ⋮ Towards computable analysis on the generalised real line ⋮ Unnamed Item ⋮ Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines

Cites Work

• Unnamed Item
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• Infinite time extensions of Kleene's \({\mathcal O}\)
• Ordinal machines and admissible recursion theory
• Set theory. An introduction to independence proofs
• Infinite Time Turing Machines With Only One Tape
• Towards a Theory of Infinite Time Blum-Shub-Smale Machines
• Discrete Transfinite Computation
• Turing Computations On Ordinals
• Ordinal Computability
• The Length of Infinite Time Turing Machine Computations
• Infinite time Turing machines
• Logical Approaches to Computational Barriers