Computability, enumerability, unsolvability: directions in recursion theory
Gespeichert in:
| Format: | Elektronisch E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Cambridge [England]
Cambridge University Press
1996
|
| Schriftenreihe: | London Mathematical Society lecture note series
224 |
| Schlagworte: | |
| Online-Zugang: | FAW01 FAW02 Volltext |
| Beschreibung: | Includes bibliographical references 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 |
| Beschreibung: | 1 Online-Ressource (vii, 347 p.) |
| ISBN: | 0511629168 0521557364 1107362393 9780511629167 9780521557368 9781107362390 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043083241 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151126s1996 |||| o||u| ||||||eng d | ||
| 020 | |a 0511629168 |c ebook |9 0-511-62916-8 | ||
| 020 | |a 0521557364 |9 0-521-55736-4 | ||
| 020 | |a 1107362393 |c electronic bk. |9 1-107-36239-3 | ||
| 020 | |a 9780511629167 |c ebook |9 978-0-511-62916-7 | ||
| 020 | |a 9780521557368 |9 978-0-521-55736-8 | ||
| 020 | |a 9781107362390 |c electronic bk. |9 978-1-107-36239-0 | ||
| 035 | |a (OCoLC)836870301 | ||
| 035 | |a (DE-599)BVBBV043083241 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 511.3/5 |2 22 | |
| 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 [England] |b Cambridge University Press |c 1996 | |
| 300 | |a 1 Online-Ressource (vii, 347 p.) | ||
| 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 Includes bibliographical references | ||
| 500 | |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 | ||
| 500 | |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 Recursivité, Théorie de la | |
| 650 | 7 | |a Récursivité, théorie de la |2 ram | |
| 650 | 7 | |a Recursie |2 gtt | |
| 650 | 7 | |a Logica |2 gtt | |
| 650 | 7 | |a Rekursionstheorie |2 swd | |
| 650 | 7 | |a Aufsatzsammlung |2 swd | |
| 650 | 7 | |a COMPUTERS / Machine Theory |2 bisacsh | |
| 650 | 7 | |a Recursion theory |2 fast | |
| 650 | 4 | |a Logik | |
| 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. |e Sonstige |4 oth | |
| 700 | 1 | |a Slaman, T. A. |e Sonstige |4 oth | |
| 700 | 1 | |a Wainer, S. S. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552379 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028507433 | ||
| 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 http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552379 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552379 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175477063024640 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV043083241 |
| collection | ZDB-4-EBA |
| ctrlnum | (OCoLC)836870301 (DE-599)BVBBV043083241 |
| 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 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04190nmm a2200637zcb4500</leader><controlfield tag="001">BV043083241</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151126s1996 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511629168</subfield><subfield code="c">ebook</subfield><subfield code="9">0-511-62916-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521557364</subfield><subfield code="9">0-521-55736-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107362393</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-107-36239-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511629167</subfield><subfield code="c">ebook</subfield><subfield code="9">978-0-511-62916-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521557368</subfield><subfield code="9">978-0-521-55736-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107362390</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-107-36239-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)836870301</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043083241</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/5</subfield><subfield code="2">22</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 [England]</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (vii, 347 p.)</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">Includes bibliographical references</subfield></datafield><datafield tag="500" ind1=" " 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="500" 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">Recursivité, Théorie de la</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Récursivité, théorie de la</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logica</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Rekursionstheorie</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Machine Theory</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursion theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logik</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="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Slaman, T. A.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wainer, S. S.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552379</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028507433</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">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552379</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552379</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</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.BV043083241 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:16:54Z |
| institution | BVB |
| isbn | 0511629168 0521557364 1107362393 9780511629167 9780521557368 9781107362390 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028507433 |
| oclc_num | 836870301 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 Online-Ressource (vii, 347 p.) |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| 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 [England] Cambridge University Press 1996 1 Online-Ressource (vii, 347 p.) txt rdacontent c rdamedia cr rdacarrier London Mathematical Society lecture note series 224 Includes bibliographical references 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 Recursivité, Théorie de la Récursivité, théorie de la ram Recursie gtt Logica gtt Rekursionstheorie swd Aufsatzsammlung swd COMPUTERS / Machine Theory bisacsh Recursion theory fast Logik 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. Sonstige oth Slaman, T. A. Sonstige oth Wainer, S. S. Sonstige oth http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552379 Aggregator 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 Recursivité, Théorie de la Récursivité, théorie de la ram Recursie gtt Logica gtt Rekursionstheorie swd Aufsatzsammlung swd COMPUTERS / Machine Theory bisacsh Recursion theory fast Logik 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 | Recursivité, Théorie de la Récursivité, théorie de la ram Recursie gtt Logica gtt Rekursionstheorie swd Aufsatzsammlung swd COMPUTERS / Machine Theory bisacsh Recursion theory fast Logik Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
| topic_facet | Recursivité, Théorie de la Récursivité, théorie de la Recursie Logica Rekursionstheorie Aufsatzsammlung COMPUTERS / Machine Theory Recursion theory Logik |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=552379 |
| work_keys_str_mv | AT coopersb computabilityenumerabilityunsolvabilitydirectionsinrecursiontheory AT slamanta computabilityenumerabilityunsolvabilitydirectionsinrecursiontheory AT wainerss computabilityenumerabilityunsolvabilitydirectionsinrecursiontheory |