Randomness and halting probabilities
From MaRDI portal
Publication:3416122
DOI10.2178/jsl/1164060463zbMath1152.03038OpenAlexW2103365303WikidataQ61927035 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
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10)
Related Items
Randomness and universal machines, Differences of halting probabilities, Universality probability of a prefix-free machine, Randomness and uniform distribution modulo one, CHAITIN’S Ω AS A CONTINUOUS FUNCTION, Random reals à la Chaitin with or without prefix-freeness, Random numbers as probabilities of machine behavior, Kobayashi compressibility, Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness
Cites Work