ITRM-recognizability from random oracles

DOI10.1007/978-3-319-20028-6_14MaRDI QIDQ3195690zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Infinite time recognizability from generic oracles and the recognizable jump operator
• The distribution of ITRM-recognizable reals
• Logical Approaches to Computational Barriers
• Optimal results on recognizability for infinite time register machines
• Randomness and degree theory for infinite time register machines

Cites work

• Algorithmic randomness and complexity.
• An Enhanced Theory of Infinite Time Register Machines
• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• Infinite computations with random oracles
• Infinite time Turing machines
• Optimal results on recognizability for infinite time register machines
• Ordinal computability
• Provident sets and rudimentary set forcing
• The basic theory of infinite time register machines
• The distribution of ITRM-recognizable reals

Cited in

(2)

• The distribution of ITRM-recognizable reals
• Infinite time recognizability from generic oracles and the recognizable jump operator

This page was built for publication: ITRM-recognizability from random oracles

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