Kolmogorov complexity conditional to large integers
From MaRDI portal
Publication:5958282
DOI10.1016/S0304-3975(01)00031-7zbMath0982.68077MaRDI QIDQ5958282
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Related Items
Cites Work
- On the relation between descriptional complexity and algorithmic probability
- On Kolmogorov's complexity and information
- Lower Limits of Frequencies in Computable Sequences and Relativized a Priori Probability
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item