Degrees of Computability
From MaRDI portal
Publication:3232282
DOI10.2307/1993049zbMath0070.24602MaRDI QIDQ3232282
Publication date: 1956
Full work available at URL: https://doi.org/10.2307/1993049
Related Items
Isomorphism Types of Index Sets of Partial Recursive Functions, Computing degrees of unsolvability, On effectively computable realizations of choice functions, Lower bounds on degrees of game-theoretic structures, On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making, On the information carried by programs about the objects they compute, On computable enumerations. I, On index sets, Some Theorems on Classes of Recursively Enumerable Sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zur Theorie der konstruktiven Wohlordnungen
- An Unsolvable Problem of Elementary Number Theory
- The Calculi of Lambda Conversion. (AM-6)
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Recursive Real Numbers
- Recursively enumerable sets of positive integers and their decision problems