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: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
1996
|
| Series: | London Mathematical Society lecture note series
224 |
| Subjects: | |
| Online Access: | BSB01 FHN01 Volltext |
| 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 |
| Item Description: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Physical Description: | 1 online resource (vii, 347 pages) |
| ISBN: | 9780511629167 |
| DOI: | 10.1017/CBO9780511629167 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043941473 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1996 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511629167 |c Online |9 978-0-511-62916-7 | ||
| 024 | 7 | |a 10.1017/CBO9780511629167 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511629167 | ||
| 035 | |a (OCoLC)849895410 | ||
| 035 | |a (DE-599)BVBBV043941473 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511.3/5 |2 20 | |
| 084 | |a SI 320 |0 (DE-625)143123: |2 rvk | ||
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 245 | 1 | 0 | |a Computability, enumerability, unsolvability |b directions in recursion theory |c edited by S.B. Cooper, T.A. Slaman, S.S. Wainer |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1996 | |
| 300 | |a 1 online resource (vii, 347 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a London Mathematical Society lecture note series |v 224 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |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 | ||
| 650 | 4 | |a Recursion theory | |
| 650 | 0 | 7 | |a Rekursionstheorie |0 (DE-588)4122329-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Rekursionstheorie |0 (DE-588)4122329-9 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Cooper, S. B. |4 edt | |
| 700 | 1 | |a Slaman, T. A. |d 1954- |4 edt | |
| 700 | 1 | |a Wainer, S. S. |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-55736-8 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511629167 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350443 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511629167 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511629167 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804176883248529408 |
|---|---|
| any_adam_object | |
| author2 | Cooper, S. B. Slaman, T. A. 1954- Wainer, S. S. |
| author2_role | edt edt edt |
| author2_variant | s b c sb sbc t a s ta tas s s w ss ssw |
| author_facet | Cooper, S. B. Slaman, T. A. 1954- Wainer, S. S. |
| building | Verbundindex |
| bvnumber | BV043941473 |
| classification_rvk | SI 320 SK 130 |
| collection | ZDB-20-CBO |
| contents | 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 |
| ctrlnum | (ZDB-20-CBO)CR9780511629167 (OCoLC)849895410 (DE-599)BVBBV043941473 |
| dewey-full | 511.3/5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/5 |
| dewey-search | 511.3/5 |
| dewey-sort | 3511.3 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/CBO9780511629167 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03704nmm a2200529zcb4500</leader><controlfield tag="001">BV043941473</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1996 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511629167</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-62916-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511629167</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511629167</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)849895410</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941473</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/5</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 320</subfield><subfield code="0">(DE-625)143123:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability, enumerability, unsolvability</subfield><subfield code="b">directions in recursion theory</subfield><subfield code="c">edited by S.B. Cooper, T.A. Slaman, S.S. Wainer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (vii, 347 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">London Mathematical Society lecture note series</subfield><subfield code="v">224</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursion theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rekursionstheorie</subfield><subfield code="0">(DE-588)4122329-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rekursionstheorie</subfield><subfield code="0">(DE-588)4122329-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cooper, S. B.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Slaman, T. A.</subfield><subfield code="d">1954-</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wainer, S. S.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-55736-8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511629167</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029350443</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511629167</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511629167</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4143413-4 Aufsatzsammlung gnd-content |
| genre_facet | Aufsatzsammlung |
| id | DE-604.BV043941473 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:15Z |
| institution | BVB |
| isbn | 9780511629167 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350443 |
| oclc_num | 849895410 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (vii, 347 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | London Mathematical Society lecture note series |
| spelling | Computability, enumerability, unsolvability directions in recursion theory edited by S.B. Cooper, T.A. Slaman, S.S. Wainer Cambridge Cambridge University Press 1996 1 online resource (vii, 347 pages) txt rdacontent c rdamedia cr rdacarrier London Mathematical Society lecture note series 224 Title from publisher's bibliographic system (viewed on 05 Oct 2015) 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 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 Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd rswk-swf 1\p (DE-588)4143413-4 Aufsatzsammlung gnd-content Rekursionstheorie (DE-588)4122329-9 s 2\p DE-604 Cooper, S. B. edt Slaman, T. A. 1954- edt Wainer, S. S. edt Erscheint auch als Druckausgabe 978-0-521-55736-8 https://doi.org/10.1017/CBO9780511629167 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Computability, enumerability, unsolvability directions in recursion theory 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 Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
| subject_GND | (DE-588)4122329-9 (DE-588)4143413-4 |
| title | Computability, enumerability, unsolvability directions in recursion theory |
| title_auth | Computability, enumerability, unsolvability directions in recursion theory |
| title_exact_search | Computability, enumerability, unsolvability directions in recursion theory |
| title_full | Computability, enumerability, unsolvability directions in recursion theory edited by S.B. Cooper, T.A. Slaman, S.S. Wainer |
| title_fullStr | Computability, enumerability, unsolvability directions in recursion theory edited by S.B. Cooper, T.A. Slaman, S.S. Wainer |
| title_full_unstemmed | Computability, enumerability, unsolvability directions in recursion theory edited by S.B. Cooper, T.A. Slaman, S.S. Wainer |
| title_short | Computability, enumerability, unsolvability |
| title_sort | computability enumerability unsolvability directions in recursion theory |
| title_sub | directions in recursion theory |
| topic | Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
| topic_facet | Recursion theory Rekursionstheorie Aufsatzsammlung |
| url | https://doi.org/10.1017/CBO9780511629167 |
| work_keys_str_mv | AT coopersb computabilityenumerabilityunsolvabilitydirectionsinrecursiontheory AT slamanta computabilityenumerabilityunsolvabilitydirectionsinrecursiontheory AT wainerss computabilityenumerabilityunsolvabilitydirectionsinrecursiontheory |