Schnorr Trivial Reals: A construction

DOI10.1016/j.entcs.2006.08.008zbMath1262.03067OpenAlexW2088056250MaRDI QIDQ4921437

Johanna N. Y. Franklin

Publication date: 10 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.08.008

zbMATH Keywords

lownessrandomnesstrivialitySchnorr trivial real

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Lowness properties and randomness
• Computational randomness and lowness
• On Schnorr and computable randomness, martingales, and machines
• Hyperimmune-free degrees and Schnorr triviality
• A Theory of Program Size Formally Identical to Information Theory
• Algorithmic Information Theory
• Schnorr randomness
• Lowness for the Class of Schnorr Random Reals
• The Degrees of Hyperimmune Sets
• The definition of random sequences
• Randomness, relativization and Turing degrees

This page was built for publication: Schnorr Trivial Reals: A construction