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...
Saved in:
| Other Authors: | , , |
|---|---|
| Format: | Edited Volume |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
1996.
|
| Series: | London Mathematical Society lecture note series
224 |
| In: |
London Mathematical Society lecture note series (224)
|
| Volumes / Articles: | Show Volumes / Articles. |
| DOI: | 10.1017/CBO9780511629167 |
| Subjects: | |
| Online Access: | Verlag, Volltext: https://doi.org/10.1017/CBO9780511629167 Verlag, Zentralblatt MATH, Inhaltstext: https://zbmath.org/?q=an:0830.00006 
|
| Author Notes: | edited by S.B. Cooper, T.A. Slaman, S.S. Wainer |
| Summary: | 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 mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource. 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 |
|---|---|
| Item Description: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Physical Description: | Online Resource |
| ISBN: | 9780511629167 |
| DOI: | 10.1017/CBO9780511629167 |