Trivial Reals

DOI10.1016/S1571-0661(04)80377-3MaRDI QIDQ4916182zbMATH OpenOpenAlexFDO

Authors Denis R. Hirschfeldt, André Nies, Rodney G. Downey, Frank Stephan

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

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Recommendations

• scientific article; zbMATH DE number 2063218
• Schnorr trivial reals: a construction
• Schnorr Trivial Reals: A construction
• Reals which compute little
• Regular reals
• Real sets
• Reals by abstraction
• scientific article; zbMATH DE number 1257325
• Cleavability over reals
• Elementary realizability

Cites work

• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
• A formal theory of inductive inference. Part I
• A Theory of Program Size Formally Identical to Information Theory
• A variant of the Kolmogorov concept of complexity
• Algorithmic randomness and complexity.
• Computational complexity of real functions
• Computational randomness and lowness
• Degrees of Unsolvability. (AM-55)
• scientific article; zbMATH DE number 4172959 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3541937 (Why is no real title available?)
• scientific article; zbMATH DE number 736618 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 1531917 (Why is no real title available?)
• scientific article; zbMATH DE number 1543065 (Why is no real title available?)
• scientific article; zbMATH DE number 4118353 (Why is no real title available?)
• scientific article; zbMATH DE number 1834658 (Why is no real title available?)
• scientific article; zbMATH DE number 841084 (Why is no real title available?)
• scientific article; zbMATH DE number 1421074 (Why is no real title available?)
• Information-theoretic characterizations of recursive infinite strings
• Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
• Lowness for the class of random sets
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On relative randomness
• Randomness and recursive enumerability
• Randomness, computability, and density
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Schnorr randomness
• The definition of random sequences
• The weak truth table degrees of recursively enumerable sets

Cited in

(6)

• Randomness and reducibility
• Triviality and minimality in the degrees of monotone complexity
• Computuing K-trivial sets by incomplete random sets
• scientific article; zbMATH DE number 2063218 (Why is no real title available?)
• Schnorr Trivial Reals: A construction
• On the Hausdorff dimension of maximal chains and antichains of Turing and hyperarithmetic degrees

This page was built for publication: Trivial Reals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916182)