Simplicity via provability for universal prefix-free Turing machines
From MaRDI portal
Publication:616504
DOI10.1016/j.tcs.2010.08.002zbMath1207.68136arXiv0906.3235WikidataQ57001536 ScholiaQ57001536MaRDI QIDQ616504
Publication date: 10 January 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.3235
Cites Work
- Representation of left-computable \(\varepsilon \)-random reals
- Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness.
- Randomness and Recursive Enumerability
- Algorithmic Randomness and Complexity
- Every computably enumerable random real is provably computably enumerable random
- Universal Recursively Enumerable Sets of Strings
- Small Semi-weakly Universal Turing Machines
- On universal computably enumerable prefix codes
- A Theory of Program Size Formally Identical to Information Theory
- The Complexity of Small Universal Turing Machines
- Four Small Universal Turing Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item