Deficiency Sets and Bounded Information Reducibilities
From MaRDI portal
Publication:3895447
DOI10.2307/1997258zbMath0449.03034OpenAlexW4231494885MaRDI QIDQ3895447
Publication date: 1974
Full work available at URL: https://doi.org/10.2307/1997258
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Cites Work
- Three theorems on the degrees of recursively enumerable sets
- Recursive and Recursively Enumerable Orders
- Retraceable Sets
- Reducibility and Completeness for Sets of Integers
- Recursively Enumerable Sets and Retracing Functions
- A Completely Mitotic Nonrecursive R.E. Degree
- Mitotic recursively enumerable sets
- Degrees of Unsolvability. (AM-55)
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Semirecursive Sets and Positive Reducibility
- A theorem on hyperhypersimple sets
- A Dichotomy of the Recursively Enumerable Sets
- The Friedberg-Muchnik Theorem Re-Examined
- Two Notes on Recursively Enumerable Sets
- A Theorem on Hypersimple Sets
- Recursively enumerable sets of positive integers and their decision problems
- Creative sets
