The Length of Infinite Time Turing Machine Computations

DOI10.1112/S0024609399006657MaRDI QIDQ4487651zbMATH OpenOpenAlexFDO

Authors

Publication date 22 June 2000

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/s0024609399006657

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Inner models, including constructibility, ordinal definability, and core models (03E45)

Recommendations

• Infinite time Turing machines
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• Logical Approaches to Computational Barriers
• Infinite time extensions of Kleene's \({\mathcal O}\)
• Eventually infinite time Turing machine degrees: infinite time decidable reals

Cited in

(31)

• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• Infinite time extensions of Kleene's \({\mathcal O}\)
• Post's problem for ordinal register machines: an explicit approach
• Some observations on infinitary complexity
• Admissibles in gaps
• Infinite time busy beavers
• Decision times of infinite computations
• Infinite computations with random oracles
• The computational strengths of -tape infinite time Turing machines
• Bounding lemmata for non-deterministic halting times of transfinite Turing machines
• Revision sequences and computers with an infinite amount of time
• Weak systems of determinacy and arithmetical quasi-inductive definitions
• Determinacy in strong cardinal models
• A Survey of Infinite Time Turing Machines
• Is P = PSPACE for Infinite Time Turing Machines?
• scientific article; zbMATH DE number 4005621 (Why is no real title available?)
• scientific article; zbMATH DE number 4057009 (Why is no real title available?)
• Infinite time Turing machines
• Eventually infinite time Turing machine degrees: infinite time decidable reals
• scientific article; zbMATH DE number 1749140 (Why is no real title available?)
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• scientific article; zbMATH DE number 1909830 (Why is no real title available?)
• scientific article; zbMATH DE number 1390284 (Why is no real title available?)
• Measure-theoretic uniformity and the Suslin functional
• Reachability for infinite time Turing machines with long tapes
• Genericity and randomness with ITTMs
• Cardinal-recognizing infinite time Turing machines
• New Computational Paradigms
• Logical Approaches to Computational Barriers
• Guest editors' introduction
• Toward higher-order infinite time Turing machines: simulational -machines

This page was built for publication: The Length of Infinite Time Turing Machine Computations

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