Randomness and halting probabilities
From MaRDI portal
Publication:3416122
DOI10.2178/jsl/1164060463zbMath1152.03038WikidataQ61927035 ScholiaQ61927035MaRDI QIDQ3416122
Verónica Becher, Joseph S. Miller, Serge Grigorieff, Santiago Figueira
Publication date: 19 January 2007
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1164060463
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D80: Applications of computability and recursion theory
03D10: Turing machines and related notions
Related Items
CHAITIN’S Ω AS A CONTINUOUS FUNCTION, Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness, Random numbers as probabilities of machine behavior, Kobayashi compressibility, Randomness and universal machines, Differences of halting probabilities, Random reals à la Chaitin with or without prefix-freeness, Randomness and uniform distribution modulo one, Universality probability of a prefix-free machine
Cites Work