Author:
Franklin Johanna N. Y.,Stephan Frank
Abstract
AbstractWe give several characterizations of Schnorr trivial sets, including a new lowness notion for Schnorr triviality based on truth-table reducibility. These characterizations allow us to see not only that some natural classes of sets, including maximal sets, are composed entirely of Schnorr trivials, but also that the Schnorr trivial sets form an ideal in the truth-table degrees but not the weak truth-table degrees. This answers a question of Downey. Griffiths and LaForte.
Publisher
Cambridge University Press (CUP)
Reference24 articles.
1. An Introduction to Kolmogorov Complexity and Its Applications
2. Process complexity and effective random tests
3. Mihailović Nenad , Algorithmic randomness, Inaugural-Dissertation, University of Heidelberg, 2007.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Trees Without Hyperimmune Branches;Revolutions and Revelations in Computability;2022
2. Uniform Relativization;Computing with Foresight and Industry;2019
3. Schnorr randomness for noncomputable measures;Information and Computation;2018-02
4. Covering the recursive sets;Annals of Pure and Applied Logic;2017-04
5. Coherence of Reducibilities with Randomness Notions;Theory of Computing Systems;2017-03-09