The computational strengths of -tape infinite time Turing machines

DOI10.1016/J.APAL.2014.04.016MaRDI QIDQ2453073zbMATHOpenAlexFDO

Authors 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

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

Recommendations

• Weaker variants of infinite time Turing machines
• Infinite time Turing machines with only one tape
• Cardinal-recognizing infinite time Turing machines
• The Length of Infinite Time Turing Machine Computations
• Infinite time Turing machines

Cites work

• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• Infinite time Turing machines
• Infinite time Turing machines with only one tape
• Infinite time extensions of Kleene's \({\mathcal O}\)
• Logical Approaches to Computational Barriers
• Ordinal computability
• Ordinal machines and admissible recursion theory
• Set theory. An introduction to independence proofs
• The Length of Infinite Time Turing Machine Computations
• Towards a theory of infinite time Blum-Shub-Smale machines
• Turing Computations On Ordinals

Cited in

(6)

• Realisability for infinitary intuitionistic set theory
• scientific article; zbMATH DE number 7199593 (Why is no real title available?)
• Taming Koepke's zoo
• Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines
• Koepke machines and satisfiability for infinitary propositional languages
• Towards computable analysis on the generalised real line

This page was built for publication: The computational strengths of \(\alpha\)-tape infinite time Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453073)