A Survey of Infinite Time Turing Machines

DOI10.1007/978-3-540-74593-8_5MaRDI QIDQ3608469zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

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
• Reachability for infinite time Turing machines with long tapes
• Cardinal-recognizing infinite time Turing machines

Cited in

(22)

• Revision sequences and computers with an infinite amount of time
• 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
• Pf ≠ NPf for almost all f
• Characterizations of ITBM-computability. I
• An Infinite Automaton Characterization of Double Exponential Time
• Is P = PSPACE for Infinite Time Turing Machines?
• Infinite time computable model theory
• The recognizability strength of infinite time Turing machines with ordinal parameters
• Infinite time Turing machines with only one tape
• scientific article; zbMATH DE number 1749140 (Why is no real title available?)
• Eventually infinite time Turing machine degrees: infinite time decidable reals
• scientific article; zbMATH DE number 1909830 (Why is no real title available?)
• Logical Approaches to Computational Barriers
• The basic theory of infinite time register machines
• Higher type recursion for transfinite machine theory
• Infinite time Turing machines
• On fixpoint arithmetic and infinite time Turing machines
• \(P\neq NP\) for infinite time Turing machines
• Infinite-time Turing machines and Borel reducibility
• Generic embeddings associated to an indestructibly weakly compact cardinal
• Infinite time decidable equivalence relation theory

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)