The following pages link to Degrees of Computability (Q3232282):
Displaying 9 items.
- Computing degrees of unsolvability (Q770790) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- Lower bounds on degrees of game-theoretic structures (Q1106754) (← links)
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making (Q1196206) (← links)
- On the information carried by programs about the objects they compute (Q1693999) (← links)
- On computable enumerations. I (Q2264759) (← links)
- On index sets (Q2542725) (← links)
- Some Theorems on Classes of Recursively Enumerable Sets (Q3255349) (← links)
- Isomorphism Types of Index Sets of Partial Recursive Functions (Q5547579) (← links)
