Recursion theory week [electronic resource] : proceedings of a conference held in Oberwolfach, FRG, March 19-25, 1989 / K. Ambos-Spies, G.H. Müller, G.E. Sacks (eds.)
These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory,...
Saved in:
| Online Access: |
Full Text (via Springer) |
|---|---|
| Other Authors: | , , |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer-Verlag,
©1990.
|
| Series: | Lecture notes in mathematics (Springer-Verlag) ;
1432. |
| Subjects: |
Table of Contents:
- From the Contents: S.B. Cooper: Enumeration reducibility, nondeterministic computations and relative computability of partial functions
- R. Downey, C. Jockusch, M. Stob: Array nonrecursive sets and multiple permitting arguments
- C.A. Haught, R.A. Shore: Undecidability and initial segments of the wtt-degrees l 0'
- S. Lempp, M. Lerman: Priority arguments using iterated trees of strategies
- W. Maass, T.A. Slaman: On the relation ship between the complexity, the degree, and the extension of a computable set
- A. Nerode, J.B. Remmel: Polynomially isolated sets.