Random numbers as probabilities of machine behavior

DOI10.1016/j.tcs.2017.02.001zbMath1370.03061arXiv1605.05838OpenAlexW2963444048MaRDI QIDQ524278

George Barmpalias, Douglas Cenzer, Christopher P. Porter

Publication date: 2 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.05838

zbMATH Keywords

probabilityrandom numbersrandom oraclesmachine

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Algorithmic randomness and dimension (03D32)

Related Items (2)

Randomness and uniform distribution modulo one ⋮ CHAITIN’S Ω AS A CONTINUOUS FUNCTION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Program size complexity for possibly infinite computations
• Classical recursion theory. The theory of functions and sets of natural numbers
• Algorithmic entropy of sets
• Classical recursion theory. Vol. II
• Random reals as measures of natural open sets
• Random reals à la Chaitin with or without prefix-freeness
• Randomness and Recursive Enumerability
• Randomness, Computability, and Density
• The typical Turing degree
• Universality probability of a prefix-free machine
• Algorithmic Randomness and Complexity
• RELATIVIZING CHAITIN'S HALTING PROBABILITY
• Randomness and halting probabilities
• From index sets to randomness in ∅ⁿ: random reals and possibly infinite computations part II
• A Theory of Program Size Formally Identical to Information Theory
• The Information Content of Typical Reals
• Computing and Combinatorics
• Minimum Message Length and Kolmogorov Complexity
• The definition of random sequences
• Computing and Combinatorics
• Random reals and possibly infinite computations Part I: Randomness in ∅′
• Recursively enumerable reals and Chaitin \(\Omega\) numbers

This page was built for publication: Random numbers as probabilities of machine behavior