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

DOI10.2178/JSL/1231082305MaRDI QIDQ3616346zbMATH OpenOpenAlexWikidataFDO

Authors Verónica Becher, Serge Grigorieff

Publication date 25 March 2009

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

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

zbMATH Keywords

\(n\)-random realinfinite computationuniversal monotone Turing machine

Mathematics Subject Classification ID

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

Recommendations

• Random reals and possibly infinite computations Part I: Randomness in ∅′
• Randomness and halting probabilities
• Random numbers as probabilities of machine behavior
• The probability of a computable output from a random oracle
• scientific article; zbMATH DE number 1886067

Cites work

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

Cited in

(13)

• \(\Sigma^ 0_ n\)-complete properties of programs and Martin-Löf randomness
• No random reals in countable support iterations
• Random reals as measures of natural open sets
• Differences of halting probabilities
• Randomness and uniform distribution modulo one
• Randomness, computation and mathematics
• \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets
• There are 2^{ℵ₀} many 𝐻-degrees in the random reals
• Random numbers as probabilities of machine behavior
• Random reals and possibly infinite computations Part I: Randomness in ∅′
• Wadge hardness in Scott spaces and its effectivization
• Infinity in computable probability
• Preface

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

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