Covering the Recursive Sets
From MaRDI portal
Publication:3195679
DOI10.1007/978-3-319-20028-6_5zbMath1461.03031arXiv1712.05875OpenAlexW1179480879MaRDI QIDQ3195679
Sebastiaan A. Terwijn, Bjørn Kjos-Hanssen, Frank Stephan
Publication date: 20 October 2015
Published in: Evolving Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.05875
Descriptive set theory (03E15) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relativized Schnorr tests with universal behavior
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classical recursion theory. Vol. II
- A Δ20 set with no infinite low subset in either it or its complement
- An Analogy between Cardinal Characteristics and Highness Properties of Oracles
- Kolmogorov complexity and the Recursion Theorem
- Algorithmic Randomness and Complexity
- Schnorr trivial sets and truth-table reducibility
- Hyperimmune-free degrees and Schnorr triviality
- FORCING WITH BUSHY TREES
- Lowness for the Class of Schnorr Random Reals
- The Degrees of Hyperimmune Sets
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Covering the Recursive Sets
