Book contents
- Frontmatter
- Contents
- Preface
- Resource bounded genericity
- On isolating r.e. and isolated d-r.e. degrees
- A characterisation of the jumps of minimal degrees below 0′
- Array nonrecursive degrees and genericity
- Dynamic properties of computably enumerable sets
- Axioms for subrecursion theories
- On the ∀ ∃ - theory of the factor lattice by the major subset relation
- Degrees of generic sets
- Embeddings into the recursively enumerable degrees
- On a question of Brown and Simpson
- Relativization of structures arising from computability theory
- A Hierarchy of domains with totality, but without density
- Inductive inference of total functions
- The Medvedev lattice of degrees of difficulty
- Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees
- APPENDIX: Questions in Recursion Theory
APPENDIX: Questions in Recursion Theory
Published online by Cambridge University Press: 23 February 2010
Book contents
- Frontmatter
- Contents
- Preface
- Resource bounded genericity
- On isolating r.e. and isolated d-r.e. degrees
- A characterisation of the jumps of minimal degrees below 0′
- Array nonrecursive degrees and genericity
- Dynamic properties of computably enumerable sets
- Axioms for subrecursion theories
- On the ∀ ∃ - theory of the factor lattice by the major subset relation
- Degrees of generic sets
- Embeddings into the recursively enumerable degrees
- On a question of Brown and Simpson
- Relativization of structures arising from computability theory
- A Hierarchy of domains with totality, but without density
- Inductive inference of total functions
- The Medvedev lattice of degrees of difficulty
- Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees
- APPENDIX: Questions in Recursion Theory
Summary
This is an informal list of some open problems in recursion theory, based on the list of open problems compiled during the Leeds Recursion Theory Year. Solutions have been announced for some of these problems. The current status of the questions below and of questions added after July 1995 can be found on the World Wide Web at html://www.math.uchicago.edu/͂ted.
Solutions and new problems are welcome and should be directed to T. A. Slaman at ted@math.uchicago.edu.
- Type
- Chapter
- Information
- Computability, Enumerability, UnsolvabilityDirections in Recursion Theory, pp. 333 - 347Publisher: Cambridge University PressPrint publication year: 1996