Trivial Reals
From MaRDI portal
Publication:4916182
DOI10.1016/S1571-0661(04)80377-3zbMath1261.03133OpenAlexW4229716168MaRDI QIDQ4916182
André Nies, Denis R. Hirschfeldt, Frank Stephan, Rodney G. Downey
Publication date: 19 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80377-3
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On relative randomness
- \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
- Computational complexity of real functions
- Information-theoretic characterizations of recursive infinite strings
- Computational randomness and lowness
- Randomness and Recursive Enumerability
- Randomness, Computability, and Density
- Algorithmic Randomness and Complexity
- A Theory of Program Size Formally Identical to Information Theory
- The weak truth table degrees of recursively enumerable sets
- Schnorr Randomness
- Lowness for the class of random sets
- Degrees of Unsolvability. (AM-55)
- A variant of the Kolmogorov concept of complexity
- The definition of random sequences
- A formal theory of inductive inference. Part I
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
This page was built for publication: Trivial Reals
