Computability, enumerability, unsolvability: Directions in recursion theory

Title ......Page 3
Copyright ......Page 4
Contents ......Page 5
Preface ......Page 7
Resource bounded genericity ......Page 9
On isolating r.e. and isolated d-r.e. degrees ......Page 69
A characterisation of the jumps of minimal degrees below 0' ......Page 89
Array nonrecursive degrees and genericity ......Page 101
Dynamic properties ofcomputably enumerable sets ......Page 113
Axioms for subrecursion theories ......Page 131
On the V3 - theory of the factor lattice by the major subset relation ......Page 147
Degrees of generic sets ......Page 175
Embeddings into the recursively enumerable degrees ......Page 193
On a question of Brown and Simpson ......Page 213
Relativization of structures arising from computability theory ......Page 227
A Hierarchy of domains with totality, but without density ......Page 241
Inductive inference of total functions ......Page 267
The Medvedev lattice of degrees of difficulty ......Page 297
Extension ofembeddings on the recursively enumerable degrees modulo the cappable degrees ......Page 321
APPENDIX: Questions in Recursion Theory ......Page 341