$$ITRM$$-Recognizability from Random Oracles

DOI10.1007/978-3-319-20028-6_14zbMath1436.03217OpenAlexW1160618729MaRDI QIDQ3195690

Merlin Carl

Publication date: 20 October 2015

Published in: Evolving Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_14

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Algorithmic randomness and dimension (03D32) Classical models of computation (Turing machines, etc.) (68Q04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The basic theory of infinite time register machines
• Infinite computations with random oracles
• The distribution of ITRM-recognizable reals
• OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES
• Algorithmic Randomness and Complexity
• An Enhanced Theory of Infinite Time Register Machines
• Ordinal Computability
• Infinite time Turing machines
• Provident sets and rudimentary set forcing