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...
Gespeichert in:
| Weitere Verfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [England] ; New York :
Cambridge University Press,
1996.
|
| Schriftenreihe: | London Mathematical Society lecture note series ;
224. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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 resource (vii, 347 pages) |
| Bibliographie: | Includes bibliographical references. |
| ISBN: | 9781107362390 1107362393 9780511629167 0511629168 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn836870301 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.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 |d OCLCL |d SFB |d OCLCQ | ||
| 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 | ||
| 035 | |a (OCoLC)836870301 |z (OCoLC)708565609 | ||
| 050 | 4 | |a QA9.6 |b .C66 1996eb | |
| 072 | 7 | |a COM |x 037000 |2 bisacsh | |
| 082 | 7 | |a 511.3/5 |2 22 | |
| 084 | |a 31.10 |2 bcl | ||
| 084 | |a 54.10 |2 bcl | ||
| 049 | |a MAIN | ||
| 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. | |
| 650 | 0 | |a Recursion theory. |0 http://id.loc.gov/authorities/subjects/sh85112012 | |
| 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 |0 http://d-nb.info/gnd/4122329-9 | |
| 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) |1 https://id.oclc.org/worldcat/entity/E39PBJdcwwDHpCWXQw9t3P3JDq |0 http://id.loc.gov/authorities/names/n95107558 | |
| 700 | 1 | |a Slaman, T. A. |q (Theodore Allen), |d 1954- |1 https://id.oclc.org/worldcat/entity/E39PBJyRFPwqHtVHh34KHtkVYP |0 http://id.loc.gov/authorities/names/n88271514 | |
| 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. |0 http://id.loc.gov/authorities/names/n42015587 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=552379 |3 Volltext |
| 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 GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn836870301 |
|---|---|
| _version_ | 1816882228341243904 |
| adam_text | |
| any_adam_object | |
| author2 | Cooper, S. B. (S. Barry) Slaman, T. A. (Theodore Allen), 1954- Wainer, S. S. |
| author2_role | |
| author2_variant | s b c sb sbc t a s ta tas s s w ss ssw |
| author_GND | http://id.loc.gov/authorities/names/n95107558 http://id.loc.gov/authorities/names/n88271514 |
| author_facet | Cooper, S. B. (S. Barry) Slaman, T. A. (Theodore Allen), 1954- Wainer, S. S. |
| author_sort | Cooper, S. B. |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.6 .C66 1996eb |
| callnumber-search | QA9.6 .C66 1996eb |
| callnumber-sort | QA 19.6 C66 41996EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| 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 | (OCoLC)836870301 |
| 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>04550cam a2200661 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn836870301</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">130408s1996 enk ob 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCA</subfield><subfield code="d">OCLCF</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UIU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">REC</subfield><subfield code="d">STF</subfield><subfield code="d">M8D</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCA</subfield><subfield code="d">AJS</subfield><subfield code="d">OCLCO</subfield><subfield code="d">INARC</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">708565609</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107362390</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107362393</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511629167</subfield><subfield code="q">(e-book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511629168</subfield><subfield code="q">(e-book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521557364</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521557368</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)836870301</subfield><subfield code="z">(OCoLC)708565609</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.6</subfield><subfield code="b">.C66 1996eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3/5</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.10</subfield><subfield code="2">bcl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bcl</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" 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="260" ind1=" " ind2=" "><subfield code="a">Cambridge [England] ;</subfield><subfield code="a">New York :</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="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">London Mathematical Society lecture note series ;</subfield><subfield code="v">224</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="505" ind1="0" 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="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Recursion theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85112012</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie de la récursivité.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">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="7"><subfield code="a">Rekursionstheorie</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4122329-9</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1="1" ind2="7"><subfield code="a">Recursie.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1="1" ind2="7"><subfield code="a">Logica.</subfield><subfield code="2">gtt</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="700" ind1="1" ind2=" "><subfield code="a">Cooper, S. B.</subfield><subfield code="q">(S. Barry)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJdcwwDHpCWXQw9t3P3JDq</subfield><subfield code="0">http://id.loc.gov/authorities/names/n95107558</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Slaman, T. A.</subfield><subfield code="q">(Theodore Allen),</subfield><subfield code="d">1954-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJyRFPwqHtVHh34KHtkVYP</subfield><subfield code="0">http://id.loc.gov/authorities/names/n88271514</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wainer, S. S.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Computability, enumerability, unsolvability.</subfield><subfield code="d">Cambridge [England] ; New York : Cambridge University Press, 1996</subfield><subfield code="z">0521557364</subfield><subfield code="w">(DLC) 95044750</subfield><subfield code="w">(OCoLC)33668032</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">London Mathematical Society lecture note series ;</subfield><subfield code="v">224.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42015587</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=552379</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10444106</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">552379</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">computabilityenu0000unse_f2k7</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">computabilityenu0000unse</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10405659</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn836870301 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:25:17Z |
| institution | BVB |
| isbn | 9781107362390 1107362393 9780511629167 0511629168 |
| language | English |
| oclc_num | 836870301 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (vii, 347 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | London Mathematical Society lecture note series ; |
| 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] ; New York : Cambridge University Press, 1996. 1 online resource (vii, 347 pages) text txt rdacontent computer c rdamedia online resource 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. Print version record. Recursion theory. http://id.loc.gov/authorities/subjects/sh85112012 Théorie de la récursivité. COMPUTERS Machine Theory. bisacsh Recursion theory fast Rekursionstheorie gnd http://d-nb.info/gnd/4122329-9 Aufsatzsammlung gnd Recursie. gtt Logica. gtt Récursivité, théorie de la. ram Cooper, S. B. (S. Barry) https://id.oclc.org/worldcat/entity/E39PBJdcwwDHpCWXQw9t3P3JDq http://id.loc.gov/authorities/names/n95107558 Slaman, T. A. (Theodore Allen), 1954- https://id.oclc.org/worldcat/entity/E39PBJyRFPwqHtVHh34KHtkVYP http://id.loc.gov/authorities/names/n88271514 Wainer, S. S. Print version: Computability, enumerability, unsolvability. Cambridge [England] ; New York : Cambridge University Press, 1996 0521557364 (DLC) 95044750 (OCoLC)33668032 London Mathematical Society lecture note series ; 224. http://id.loc.gov/authorities/names/n42015587 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=552379 Volltext |
| spellingShingle | Computability, enumerability, unsolvability : directions in recursion theory / London Mathematical Society lecture note series ; 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. http://id.loc.gov/authorities/subjects/sh85112012 Théorie de la récursivité. COMPUTERS Machine Theory. bisacsh Recursion theory fast Rekursionstheorie gnd http://d-nb.info/gnd/4122329-9 Aufsatzsammlung gnd Recursie. gtt Logica. gtt Récursivité, théorie de la. ram |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85112012 http://d-nb.info/gnd/4122329-9 |
| 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. http://id.loc.gov/authorities/subjects/sh85112012 Théorie de la récursivité. COMPUTERS Machine Theory. bisacsh Recursion theory fast Rekursionstheorie gnd http://d-nb.info/gnd/4122329-9 Aufsatzsammlung gnd Recursie. gtt Logica. gtt Récursivité, théorie de la. ram |
| topic_facet | Recursion theory. Théorie de la récursivité. COMPUTERS Machine Theory. Recursion theory Rekursionstheorie Aufsatzsammlung Recursie. Logica. Récursivité, théorie de la. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=552379 |
| work_keys_str_mv | AT coopersb computabilityenumerabilityunsolvabilitydirectionsinrecursiontheory AT slamanta computabilityenumerabilityunsolvabilitydirectionsinrecursiontheory AT wainerss computabilityenumerabilityunsolvabilitydirectionsinrecursiontheory |