Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | , , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge [England] ; New York :
Cambridge University Press,
1996.
|
| Colección: | London Mathematical Society lecture note series ;
224. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocn836870301 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130408s1996 enk ob 000 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d E7B |d OCLCA |d OCLCF |d YDXCP |d OCLCQ |d UIU |d OCLCQ |d UAB |d OCLCQ |d VTS |d REC |d STF |d M8D |d OCLCO |d OCLCA |d AJS |d OCLCO |d INARC |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 708565609 | ||
| 020 | |a 9781107362390 |q (electronic bk.) | ||
| 020 | |a 1107362393 |q (electronic bk.) | ||
| 020 | |a 9780511629167 |q (e-book) | ||
| 020 | |a 0511629168 |q (e-book) | ||
| 020 | |z 0521557364 | ||
| 020 | |z 9780521557368 | ||
| 029 | 1 | |a DEBBG |b BV043083241 | |
| 029 | 1 | |a DEBSZ |b 421267461 | |
| 029 | 1 | |a GBVCP |b 80453523X | |
| 035 | |a (OCoLC)836870301 |z (OCoLC)708565609 | ||
| 050 | 4 | |a QA9.6 |b .C66 1996eb | |
| 072 | 7 | |a COM |x 037000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511.3/5 |2 22 |
| 084 | |a 31.10 |2 bcl | ||
| 084 | |a 54.10 |2 bcl | ||
| 049 | |a UAMI | ||
| 245 | 0 | 0 | |a Computability, enumerability, unsolvability : |b directions in recursion theory / |c edited by S.B. Cooper, T.A. Slaman, S.S. Wainer. |
| 260 | |a Cambridge [England] ; |a New York : |b Cambridge University Press, |c 1996. | ||
| 300 | |a 1 online resource (vii, 347 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a London Mathematical Society lecture note series ; |v 224 | |
| 504 | |a Includes bibliographical references. | ||
| 505 | 0 | |a 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. | |
| 520 | |a 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. | ||
| 588 | 0 | |a Print version record. | |
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Recursion theory. | |
| 650 | 6 | |a Théorie de la récursivité. | |
| 650 | 7 | |a COMPUTERS |x Machine Theory. |2 bisacsh | |
| 650 | 7 | |a Recursion theory |2 fast | |
| 650 | 7 | |a Rekursionstheorie |2 gnd | |
| 650 | 7 | |a Aufsatzsammlung |2 gnd | |
| 650 | 1 | 7 | |a Recursie. |2 gtt |
| 650 | 1 | 7 | |a Logica. |2 gtt |
| 650 | 7 | |a Récursivité, théorie de la. |2 ram | |
| 700 | 1 | |a Cooper, S. B. |q (S. Barry) | |
| 700 | 1 | |a Slaman, T. A. |q (Theodore Allen), |d 1954- | |
| 700 | 1 | |a Wainer, S. S. | |
| 776 | 0 | 8 | |i Print version: |t Computability, enumerability, unsolvability. |d Cambridge [England] ; New York : Cambridge University Press, 1996 |z 0521557364 |w (DLC) 95044750 |w (OCoLC)33668032 |
| 830 | 0 | |a London Mathematical Society lecture note series ; |v 224. | |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=552379 |z Texto completo |
| 938 | |a ebrary |b EBRY |n ebr10444106 | ||
| 938 | |a EBSCOhost |b EBSC |n 552379 | ||
| 938 | |a Internet Archive |b INAR |n computabilityenu0000unse_f2k7 | ||
| 938 | |a Internet Archive |b INAR |n computabilityenu0000unse | ||
| 938 | |a YBP Library Services |b YANK |n 10405659 | ||
| 994 | |a 92 |b IZTAP | ||