The computational strengths of -tape infinite time Turing machines
DOI10.1016/J.APAL.2014.04.016zbMATH Open1352.03046OpenAlexW1990176504MaRDI QIDQ2453073FDOQ2453073
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
Recommendations
Computation over the reals, computable analysis (03D78) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Turing machines and related notions (03D10)
Cites Work
- Set theory. An introduction to independence proofs
- Title not available (Why is that?)
- Infinite time Turing machines
- Ordinal machines and admissible recursion theory
- Turing Computations On Ordinals
- Infinite time Turing machines with only one tape
- Ordinal computability
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
- The Length of Infinite Time Turing Machine Computations
- Infinite time extensions of Kleene's \({\mathcal O}\)
- Logical Approaches to Computational Barriers
- Towards a theory of infinite time Blum-Shub-Smale machines
- Discrete transfinite computation models
Cited In (6)
- Koepke machines and satisfiability for infinitary propositional languages
- Towards computable analysis on the generalised real line
- Title not available (Why is that?)
- Taming Koepke's zoo
- Realisability for infinitary intuitionistic set theory
- Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines
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)
