On Reducibility by Recursive Functions
From MaRDI portal
Publication:5344161
DOI10.2307/2034902zbMath0134.00804MaRDI QIDQ5344161
Publication date: 1964
Full work available at URL: https://doi.org/10.2307/2034902
Related Items
Cites Work
- Recursive digraphs, splinters and cylinders
- The upper semi-lattice of degrees of recursive unsolvability
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Two Notes on Recursively Enumerable Sets
- Recursively enumerable sets of positive integers and their decision problems
- Unnamed Item