Random reals à la Chaitin with or without prefix-freeness
From MaRDI portal
Publication:2456371
DOI10.1016/j.tcs.2007.06.007zbMath1124.68046WikidataQ61927028 ScholiaQ61927028MaRDI QIDQ2456371
Serge Grigorieff, Verónica Becher
Publication date: 18 October 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.06.007
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Related Items
Preface, Random numbers as probabilities of machine behavior, Universality probability of a prefix-free machine, From index sets to randomness in ∅n: random reals and possibly infinite computations part II
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomness and universal machines
- On the symmetric enumeration degrees
- On a hierarchy of sets. III
- Kleene index sets and functional m-degrees
- Randomness and halting probabilities
- On initial segment complexity and degrees of randomness
- Algorithmic Information Theory
- A Theory of Program Size Formally Identical to Information Theory
- A unified approach to the definition of random sequences
- Random reals and possibly infinite computations Part I: Randomness in ∅′