Degrees of Computability
From MaRDI portal
Cites work
- An Unsolvable Problem of Elementary Number Theory
- Classes of Recursively Enumerable Sets and Their Decision Problems
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- scientific article; zbMATH DE number 3053259 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Recursive Real Numbers
- Recursively enumerable sets of positive integers and their decision problems
- The Calculi of Lambda Conversion. (AM-6)
- Zur Theorie der konstruktiven Wohlordnungen
Cited in
(10)- 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
- Isomorphism Types of Index Sets of Partial Recursive Functions
- Undecidability in physics: a review
- Computing degrees of unsolvability
This page was built for publication: Degrees of Computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3232282)
