Schnorr trivial sets and truth-table reducibility
From MaRDI portal
Publication:3570160
DOI10.2178/jsl/1268917492zbMath1193.03073OpenAlexW2014032276MaRDI QIDQ3570160
Johanna N. Y. Franklin, Frank Stephan
Publication date: 24 June 2010
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1268917492
Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)
Related Items (15)
Reducibilities relating to Schnorr randomness ⋮ When does randomness come from randomness? ⋮ Covering the Recursive Sets ⋮ Depth, Highness and DNR Degrees ⋮ Schnorr randomness for noncomputable measures ⋮ Strength and Weakness in Computable Structure Theory ⋮ On effectively closed sets of effective strong measure zero ⋮ Truth-table Schnorr randomness and truth-table reducible randomness ⋮ Covering the recursive sets ⋮ Lowness for Demuth Randomness ⋮ Relatively computably enumerable reals ⋮ Coherence of reducibilities with randomness notions ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ On trees without hyperimmune branches ⋮ Schnorr triviality and its equivalent notions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Schnorr trivial reals: a construction
- Classical recursion theory. Vol. II
- Process complexity and effective random tests
- A maximal set which is not complete
- Lowness properties and randomness
- On Schnorr and computable randomness, martingales, and machines
- Calibrating Randomness
- A cohesive set which is not high
- Using random sets as oracles
- The Degrees of Hyperimmune Sets
- The definition of random sequences
- Randomness, relativization and Turing degrees
This page was built for publication: Schnorr trivial sets and truth-table reducibility
