From index sets to randomness in ∅n: random reals and possibly infinite computations part II

DOI10.2178/JSL/1231082305zbMath1163.03023OpenAlexW2120860507WikidataQ61927027 ScholiaQ61927027MaRDI QIDQ3616346

Serge Grigorieff, Verónica Becher

Publication date: 25 March 2009

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1231082305

zbMATH Keywords

infinite computation\(n\)-random realuniversal monotone Turing machine

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10)

Related Items (8)

Randomness, Computation and Mathematics ⋮ \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets ⋮ Differences of halting probabilities ⋮ Randomness and uniform distribution modulo one ⋮ Preface ⋮ Random numbers as probabilities of machine behavior ⋮ Wadge hardness in Scott spaces and its effectivization ⋮ Random reals as measures of natural open sets

Cites Work

• Unnamed Item
• Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
• Random reals à la Chaitin with or without prefix-freeness
• Hierarchies in?-spaces and applications
• A Theory of Program Size Formally Identical to Information Theory
• Recursively enumerable sets and degrees
• Randomness via effective descriptive set theory
• Number theoretic concepts and recursive well-orderings
• Random reals and possibly infinite computations Part I: Randomness in ∅′

This page was built for publication: From index sets to randomness in ∅ⁿ: random reals and possibly infinite computations part II