A Survey of Infinite Time Turing Machines
From MaRDI portal
Publication:3608469
DOI10.1007/978-3-540-74593-8_5zbMATH Open1211.03060OpenAlexW1839313100MaRDI QIDQ3608469FDOQ3608469
Authors: Joel David Hamkins 
Publication date: 5 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74593-8_5
Recommendations
- Infinite time Turing machines
- scientific article; zbMATH DE number 1909830
- New Computational Paradigms
- The Length of Infinite Time Turing Machine Computations
- Infinite-time Turing machines and Borel reducibility
- Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
- Space and time complexity for infinite time Turing machines
- On fixpoint arithmetic and infinite time Turing machines
- scientific article; zbMATH DE number 7199593
- Cardinal-recognizing infinite time Turing machines
Cited In (22)
- Eventually infinite time Turing machine degrees: infinite time decidable reals
- Infinite time decidable equivalence relation theory
- Abstract geometrical computation. III: Black holes for classical and analog computing
- Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
- \(P\neq NP\) for infinite time Turing machines
- Title not available (Why is that?)
- Revision sequences and computers with an infinite amount of time
- Characterizations of ITBM-computability. I
- Title not available (Why is that?)
- Infinite-time Turing machines and Borel reducibility
- Higher type recursion for transfinite machine theory
- Logical Approaches to Computational Barriers
- On fixpoint arithmetic and infinite time Turing machines
- Pf ≠ NPf for almost all f
- Is P = PSPACE for Infinite Time Turing Machines?
- An Infinite Automaton Characterization of Double Exponential Time
- Generic embeddings associated to an indestructibly weakly compact cardinal
- Infinite time computable model theory
- The recognizability strength of infinite time Turing machines with ordinal parameters
- Infinite time Turing machines with only one tape
- The basic theory of infinite time register machines
- Infinite time Turing machines
This page was built for publication: A Survey of Infinite Time Turing Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608469)
