Degrees of Computability

DOI10.2307/1993049zbMath0070.24602OpenAlexW4232225658MaRDI QIDQ3232282

Norman Shapiro

Publication date: 1956

Full work available at URL: https://doi.org/10.2307/1993049

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (9)

Lower bounds on degrees of game-theoretic structures ⋮ Isomorphism Types of Index Sets of Partial Recursive Functions ⋮ On the information carried by programs about the objects they compute ⋮ On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making ⋮ On computable enumerations. I ⋮ On index sets ⋮ Computing degrees of unsolvability ⋮ Some Theorems on Classes of Recursively Enumerable Sets ⋮ On effectively computable realizations of choice functions

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degrees of Computability