Computability theory: an introduction to recursion theory
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
Academic Press
c2011
|
| Schlagworte: | |
| Online-Zugang: | BTU01 Volltext |
| Beschreibung: | Computability Theory: An Introduction to Recursion Theory, provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way. Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory 1. The Computability Concept; 2. General Recursive Functions; 3. Programs and Machines; 4. Recursive Enumerability; 5. Connections to Logic; 6. Degrees of Unsolvability; 7. Polynomial-Time Computability; Appendix: Mathspeak; Appendix: Countability; Appendix: Decadic Notation Includes bibliographical references and index The computability concept -- General recursive functions -- Programs and machines -- Recursive enumerability -- Connections to logic -- Degrees of unsolvability -- Polynomial-time computability -- A1: Mathspeak -- A2: Countability -- A3: Decadic Notation |
| Beschreibung: | 1 Online-Ressource (1 online resource (viii, 174 p.)) |
| ISBN: | 9780123849588 0123849586 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV039830057 | ||
| 003 | DE-604 | ||
| 005 | 20190307 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 120124s2011 sz |||| o||u| ||||||eng d | ||
| 020 | |a 9780123849588 |c electronic bk. |9 978-0-12-384958-8 | ||
| 020 | |a 0123849586 |c electronic bk. |9 0-12-384958-6 | ||
| 035 | |a (ZDB-33-EBS)ocn706803074 | ||
| 035 | |a (OCoLC)706803074 | ||
| 035 | |a (DE-599)BVBBV039830057 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a sz |c XA-CH | ||
| 049 | |a DE-634 |a DE-1046 |a DE-19 | ||
| 082 | 0 | |a 511.3/5 |2 22 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Enderton, Herbert B. |d 1936-2010 |e Verfasser |0 (DE-588)143379356 |4 aut | |
| 245 | 1 | 0 | |a Computability theory |b an introduction to recursion theory |c Herbert B. Enderton |
| 264 | 1 | |a Amsterdam |b Academic Press |c c2011 | |
| 300 | |a 1 Online-Ressource (1 online resource (viii, 174 p.)) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Computability Theory: An Introduction to Recursion Theory, provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way. Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory | ||
| 500 | |a 1. The Computability Concept; 2. General Recursive Functions; 3. Programs and Machines; 4. Recursive Enumerability; 5. Connections to Logic; 6. Degrees of Unsolvability; 7. Polynomial-Time Computability; Appendix: Mathspeak; Appendix: Countability; Appendix: Decadic Notation | ||
| 500 | |a Includes bibliographical references and index | ||
| 500 | |a The computability concept -- General recursive functions -- Programs and machines -- Recursive enumerability -- Connections to logic -- Degrees of unsolvability -- Polynomial-time computability -- A1: Mathspeak -- A2: Countability -- A3: Decadic Notation | ||
| 650 | 4 | |a Recursion theory | |
| 650 | 0 | 7 | |a Rekursionstheorie |0 (DE-588)4122329-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rekursionstheorie |0 (DE-588)4122329-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9780123849588 |x Verlag |3 Volltext |
| 912 | |a ZDB-33-ESD |a ebook |a ZDB-33-MTC |a ZDB-33-EBS | ||
| 940 | 1 | |q FAW_PDA_ESD | |
| 940 | 1 | |q UBM_PDA_ESD_Kauf | |
| 940 | 1 | |q FLA_PDA_ESD | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024690061 | ||
| 966 | e | |u http://www.sciencedirect.com/science/book/9780123849588 |l BTU01 |p ZDB-33-MTC |q BTU_PDA_MTC_Kauf |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804148764626124800 |
|---|---|
| any_adam_object | |
| author | Enderton, Herbert B. 1936-2010 |
| author_GND | (DE-588)143379356 |
| author_facet | Enderton, Herbert B. 1936-2010 |
| author_role | aut |
| author_sort | Enderton, Herbert B. 1936-2010 |
| author_variant | h b e hb hbe |
| building | Verbundindex |
| bvnumber | BV039830057 |
| classification_rvk | SK 130 ST 134 |
| collection | ZDB-33-ESD ebook ZDB-33-MTC ZDB-33-EBS |
| ctrlnum | (ZDB-33-EBS)ocn706803074 (OCoLC)706803074 (DE-599)BVBBV039830057 |
| 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 | Informatik Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03489nmm a2200493zc 4500</leader><controlfield tag="001">BV039830057</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190307 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">120124s2011 sz |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780123849588</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-12-384958-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0123849586</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">0-12-384958-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-EBS)ocn706803074</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)706803074</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039830057</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="044" ind1=" " ind2=" "><subfield code="a">sz</subfield><subfield code="c">XA-CH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-19</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/5</subfield><subfield code="2">22</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="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Enderton, Herbert B.</subfield><subfield code="d">1936-2010</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)143379356</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability theory</subfield><subfield code="b">an introduction to recursion theory</subfield><subfield code="c">Herbert B. Enderton</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">Academic Press</subfield><subfield code="c">c2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (1 online resource (viii, 174 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="500" ind1=" " ind2=" "><subfield code="a">Computability Theory: An Introduction to Recursion Theory, provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way. Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">1. The Computability Concept; 2. General Recursive Functions; 3. Programs and Machines; 4. Recursive Enumerability; 5. Connections to Logic; 6. Degrees of Unsolvability; 7. Polynomial-Time Computability; Appendix: Mathspeak; Appendix: Countability; Appendix: Decadic Notation</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">The computability concept -- General recursive functions -- Programs and machines -- Recursive enumerability -- Connections to logic -- Degrees of unsolvability -- Polynomial-time computability -- A1: Mathspeak -- A2: Countability -- A3: Decadic Notation</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="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="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9780123849588</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield><subfield code="a">ebook</subfield><subfield code="a">ZDB-33-MTC</subfield><subfield code="a">ZDB-33-EBS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FAW_PDA_ESD</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">UBM_PDA_ESD_Kauf</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FLA_PDA_ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024690061</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://www.sciencedirect.com/science/book/9780123849588</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-33-MTC</subfield><subfield code="q">BTU_PDA_MTC_Kauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV039830057 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:12:19Z |
| institution | BVB |
| isbn | 9780123849588 0123849586 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024690061 |
| oclc_num | 706803074 |
| open_access_boolean | |
| owner | DE-634 DE-1046 DE-19 DE-BY-UBM |
| owner_facet | DE-634 DE-1046 DE-19 DE-BY-UBM |
| physical | 1 Online-Ressource (1 online resource (viii, 174 p.)) |
| psigel | ZDB-33-ESD ebook ZDB-33-MTC ZDB-33-EBS FAW_PDA_ESD UBM_PDA_ESD_Kauf FLA_PDA_ESD ZDB-33-MTC BTU_PDA_MTC_Kauf |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Academic Press |
| record_format | marc |
| spelling | Enderton, Herbert B. 1936-2010 Verfasser (DE-588)143379356 aut Computability theory an introduction to recursion theory Herbert B. Enderton Amsterdam Academic Press c2011 1 Online-Ressource (1 online resource (viii, 174 p.)) txt rdacontent c rdamedia cr rdacarrier Computability Theory: An Introduction to Recursion Theory, provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way. Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory 1. The Computability Concept; 2. General Recursive Functions; 3. Programs and Machines; 4. Recursive Enumerability; 5. Connections to Logic; 6. Degrees of Unsolvability; 7. Polynomial-Time Computability; Appendix: Mathspeak; Appendix: Countability; Appendix: Decadic Notation Includes bibliographical references and index The computability concept -- General recursive functions -- Programs and machines -- Recursive enumerability -- Connections to logic -- Degrees of unsolvability -- Polynomial-time computability -- A1: Mathspeak -- A2: Countability -- A3: Decadic Notation Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd rswk-swf Rekursionstheorie (DE-588)4122329-9 s DE-604 http://www.sciencedirect.com/science/book/9780123849588 Verlag Volltext |
| spellingShingle | Enderton, Herbert B. 1936-2010 Computability theory an introduction to recursion theory Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
| subject_GND | (DE-588)4122329-9 |
| title | Computability theory an introduction to recursion theory |
| title_auth | Computability theory an introduction to recursion theory |
| title_exact_search | Computability theory an introduction to recursion theory |
| title_full | Computability theory an introduction to recursion theory Herbert B. Enderton |
| title_fullStr | Computability theory an introduction to recursion theory Herbert B. Enderton |
| title_full_unstemmed | Computability theory an introduction to recursion theory Herbert B. Enderton |
| title_short | Computability theory |
| title_sort | computability theory an introduction to recursion theory |
| title_sub | an introduction to recursion theory |
| topic | Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
| topic_facet | Recursion theory Rekursionstheorie |
| url | http://www.sciencedirect.com/science/book/9780123849588 |
| work_keys_str_mv | AT endertonherbertb computabilitytheoryanintroductiontorecursiontheory |