Computability, enumerability, unsolvability directions in recursion theory /
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure m...
| Други автори: | Cooper, S. B., Slaman, T. A. 1954-, Wainer, S. S. |
|---|---|
| Формат: | Електронен |
| Език: | English |
| Публикувано: |
Cambridge [England] ; New York :
Cambridge University Press,
1996.
|
| Серия: |
London Mathematical Society lecture note series ;
224. |
| Предмети: | |
| Онлайн достъп: |
http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=552379 |
| Подобни документи: |
Print version::
Computability, enumerability, unsolvability. |
Съдържание:
- Resource bounded genericity / K. Ambos-Spies
- On isolating r.e. and isolated d-r.e. degrees / M.M. Arslanov, S. Lempp and R.A. Shore
- A characterisation of the jumps of minimal degrees below 0' / S.B. Cooper
- Array nonrecursive degrees and genericity / R. Downey, C.G. Jockusch and M. Stob
- Dynamic properties of computably enumerable sets / L. Harrington and R.I. Soare
- Axioms for subrecursion theories / A.J. Heaton and S.S. Wainer
- On the [actual symbol not reproducible]
- theory of the factor lattice by the major subset relation / E. Herrmann
- Degrees of generic sets / M. Kumabe
- Embeddings into the recursively enumerable degrees / M. Lerman
- On a question of Brown and Simpson / M.E. Mytilinaios and T.A. Slaman
- Relativization of structures arising from computability theory / A. Nies
- A Hierarchy of domains with totality, but without density / D. Normann
- Inductive inference of total functions / P. Odifreddi.