Schnorr triviality and genericity

DOI10.2178/jsl/1264433915zbMath1184.03040OpenAlexW1984336238MaRDI QIDQ5190195

Johanna N. Y. Franklin

Publication date: 15 March 2010

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1264433915

zbMATH Keywords

genericityalgorithmic randomnessTuring degreesSchnorr triviality\(K\)-trivials

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Related Items (3)

On effectively closed sets of effective strong measure zero ⋮ Coherence of reducibilities with randomness notions ⋮ Unified characterizations of lowness properties via Kolmogorov complexity

Cites Work

• Schnorr trivial reals: a construction
• Classical recursion theory. Vol. II
• Lowness properties and randomness
• On Schnorr and computable randomness, martingales, and machines
• Calibrating Randomness
• A Theory of Program Size Formally Identical to Information Theory
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability

This page was built for publication: Schnorr triviality and genericity