Schnorr trivial reals: a construction

DOI10.1007/S00153-007-0061-3zbMath1142.03020OpenAlexW2087642972MaRDI QIDQ926182

Johanna N. Y. Franklin

Publication date: 26 May 2008

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-007-0061-3

zbMATH Keywords

RandomnessSchnorr trivialTriviality

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (5)

Strength and Weakness in Computable Structure Theory ⋮ Schnorr trivial sets and truth-table reducibility ⋮ Schnorr triviality and genericity ⋮ Hyperimmune-free degrees and Schnorr triviality ⋮ Unified characterizations of lowness properties via Kolmogorov complexity

Cites Work

• Unnamed Item
• Lowness properties and randomness
• Computational randomness and lowness
• On Schnorr and computable randomness, martingales, and machines
• Calibrating Randomness
• 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
• A unified approach to the definition of random sequences
• The definition of random sequences
• Randomness, relativization and Turing degrees

This page was built for publication: Schnorr trivial reals: a construction