Classical recursion theory: the theory of functions and sets of natural numbers
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
North-Holland
1989-1999
|
| Schriftenreihe: | Studies in logic and the foundations of mathematics
v. 125, 143 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Vol. 2 lacks other title information. - "First edition 1999"--V. 2, t.p. verso. - Vol. 2 published: Amsterdam ; New York : Elsevier Volume II of <IT>Classical Recursion Theory</IT> describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, ranging from small time and space bounds to the elementary functions, with a particular attention to polynomial time and space computability. It also deals with primitive recursive functions and larger classes, which are of interest to the proof theorist. The second half of the book starts with the classical theory of recursively enumerable sets and degrees, which constitutes the core of Recursion or Computability Theory. Unlike other texts, usually confined to the Turing degrees, the book covers a variety of other strong reducibilities, studying both their individual structures and their mutual relationships. The last chapters extend the theory to limit sets and arithmetical sets. The volume ends with the first textbook treatment of the enumeration degrees, which admit a number of applications from algebra to the Lambda Calculus. The book is a valuable source of information for anyone interested in Complexity and Computability Theory. The student will appreciate the detailed but informal account of a wide variety of basic topics, while the specialist will find a wealth of material sketched in exercises and asides. A massive bibliography of more than a thousand titles completes the treatment on the historical side Includes bibliographical references and indexes |
| Beschreibung: | 1 Online-Ressource (2 v.) |
| ISBN: | 9780444502056 044450205X 0444872957 9780444872951 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042317323 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150129s1989 |||| o||u| ||||||eng d | ||
| 020 | |a 9780444502056 |9 978-0-444-50205-6 | ||
| 020 | |a 044450205X |9 0-444-50205-X | ||
| 020 | |a 0444872957 |c v. 1 |9 0-444-87295-7 | ||
| 020 | |a 9780444872951 |c v. 1 |9 978-0-444-87295-1 | ||
| 035 | |a (ZDB-33-EBS)ocn162578059 | ||
| 035 | |a (OCoLC)162578059 | ||
| 035 | |a (DE-599)BVBBV042317323 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 | ||
| 082 | 0 | |a 511.3 |2 22 | |
| 100 | 1 | |a Odifreddi, Piergiorgio |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Classical recursion theory |b the theory of functions and sets of natural numbers |c Piergiorgio Odifreddi |
| 264 | 1 | |a Amsterdam |b North-Holland |c 1989-1999 | |
| 300 | |a 1 Online-Ressource (2 v.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Studies in logic and the foundations of mathematics |v v. 125, 143 | |
| 500 | |a Vol. 2 lacks other title information. - "First edition 1999"--V. 2, t.p. verso. - Vol. 2 published: Amsterdam ; New York : Elsevier | ||
| 500 | |a Volume II of <IT>Classical Recursion Theory</IT> describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, ranging from small time and space bounds to the elementary functions, with a particular attention to polynomial time and space computability. It also deals with primitive recursive functions and larger classes, which are of interest to the proof theorist. The second half of the book starts with the classical theory of recursively enumerable sets and degrees, which constitutes the core of Recursion or Computability Theory. Unlike other texts, usually confined to the Turing degrees, the book covers a variety of other strong reducibilities, studying both their individual structures and their mutual relationships. The last chapters extend the theory to limit sets and arithmetical sets. The volume ends with the first textbook treatment of the enumeration degrees, which admit a number of applications from algebra to the Lambda Calculus. The book is a valuable source of information for anyone interested in Complexity and Computability Theory. The student will appreciate the detailed but informal account of a wide variety of basic topics, while the specialist will find a wealth of material sketched in exercises and asides. A massive bibliography of more than a thousand titles completes the treatment on the historical side | ||
| 500 | |a Includes bibliographical references and indexes | ||
| 650 | 4 | |a Récursivité, Théorie de la | |
| 650 | 7 | |a Récursivité, Théorie de la |2 ram | |
| 650 | 7 | |a Recursion theory |2 fast | |
| 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 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9780444502056 |x Verlag |3 Volltext |
| 912 | |a ZDB-33-ESD |a ZDB-33-EBS | ||
| 940 | 1 | |q FAW_PDA_ESD | |
| 940 | 1 | |q FLA_PDA_ESD | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027754313 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804152913613815808 |
|---|---|
| any_adam_object | |
| author | Odifreddi, Piergiorgio |
| author_facet | Odifreddi, Piergiorgio |
| author_role | aut |
| author_sort | Odifreddi, Piergiorgio |
| author_variant | p o po |
| building | Verbundindex |
| bvnumber | BV042317323 |
| collection | ZDB-33-ESD ZDB-33-EBS |
| ctrlnum | (ZDB-33-EBS)ocn162578059 (OCoLC)162578059 (DE-599)BVBBV042317323 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| 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>03654nmm a2200505zcb4500</leader><controlfield tag="001">BV042317323</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150129s1989 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780444502056</subfield><subfield code="9">978-0-444-50205-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">044450205X</subfield><subfield code="9">0-444-50205-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444872957</subfield><subfield code="c">v. 1</subfield><subfield code="9">0-444-87295-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780444872951</subfield><subfield code="c">v. 1</subfield><subfield code="9">978-0-444-87295-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-EBS)ocn162578059</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)162578059</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042317323</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></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Odifreddi, Piergiorgio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Classical recursion theory</subfield><subfield code="b">the theory of functions and sets of natural numbers</subfield><subfield code="c">Piergiorgio Odifreddi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">North-Holland</subfield><subfield code="c">1989-1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (2 v.)</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">Studies in logic and the foundations of mathematics</subfield><subfield code="v">v. 125, 143</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Vol. 2 lacks other title information. - "First edition 1999"--V. 2, t.p. verso. - Vol. 2 published: Amsterdam ; New York : Elsevier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Volume II of <IT>Classical Recursion Theory</IT> describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, ranging from small time and space bounds to the elementary functions, with a particular attention to polynomial time and space computability. It also deals with primitive recursive functions and larger classes, which are of interest to the proof theorist. The second half of the book starts with the classical theory of recursively enumerable sets and degrees, which constitutes the core of Recursion or Computability Theory. Unlike other texts, usually confined to the Turing degrees, the book covers a variety of other strong reducibilities, studying both their individual structures and their mutual relationships. The last chapters extend the theory to limit sets and arithmetical sets. The volume ends with the first textbook treatment of the enumeration degrees, which admit a number of applications from algebra to the Lambda Calculus. The book is a valuable source of information for anyone interested in Complexity and Computability Theory. The student will appreciate the detailed but informal account of a wide variety of basic topics, while the specialist will find a wealth of material sketched in exercises and asides. A massive bibliography of more than a thousand titles completes the treatment on the historical side</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and indexes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Récursivité, 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">Recursion theory</subfield><subfield code="2">fast</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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9780444502056</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">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">FLA_PDA_ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027754313</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></record></collection> |
| id | DE-604.BV042317323 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:18:16Z |
| institution | BVB |
| isbn | 9780444502056 044450205X 0444872957 9780444872951 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027754313 |
| oclc_num | 162578059 |
| open_access_boolean | |
| owner | DE-1046 |
| owner_facet | DE-1046 |
| physical | 1 Online-Ressource (2 v.) |
| psigel | ZDB-33-ESD ZDB-33-EBS FAW_PDA_ESD FLA_PDA_ESD |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | North-Holland |
| record_format | marc |
| series2 | Studies in logic and the foundations of mathematics |
| spelling | Odifreddi, Piergiorgio Verfasser aut Classical recursion theory the theory of functions and sets of natural numbers Piergiorgio Odifreddi Amsterdam North-Holland 1989-1999 1 Online-Ressource (2 v.) txt rdacontent c rdamedia cr rdacarrier Studies in logic and the foundations of mathematics v. 125, 143 Vol. 2 lacks other title information. - "First edition 1999"--V. 2, t.p. verso. - Vol. 2 published: Amsterdam ; New York : Elsevier Volume II of <IT>Classical Recursion Theory</IT> describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, ranging from small time and space bounds to the elementary functions, with a particular attention to polynomial time and space computability. It also deals with primitive recursive functions and larger classes, which are of interest to the proof theorist. The second half of the book starts with the classical theory of recursively enumerable sets and degrees, which constitutes the core of Recursion or Computability Theory. Unlike other texts, usually confined to the Turing degrees, the book covers a variety of other strong reducibilities, studying both their individual structures and their mutual relationships. The last chapters extend the theory to limit sets and arithmetical sets. The volume ends with the first textbook treatment of the enumeration degrees, which admit a number of applications from algebra to the Lambda Calculus. The book is a valuable source of information for anyone interested in Complexity and Computability Theory. The student will appreciate the detailed but informal account of a wide variety of basic topics, while the specialist will find a wealth of material sketched in exercises and asides. A massive bibliography of more than a thousand titles completes the treatment on the historical side Includes bibliographical references and indexes Récursivité, Théorie de la Récursivité, Théorie de la ram Recursion theory fast Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd rswk-swf Rekursionstheorie (DE-588)4122329-9 s 1\p DE-604 http://www.sciencedirect.com/science/book/9780444502056 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Odifreddi, Piergiorgio Classical recursion theory the theory of functions and sets of natural numbers Récursivité, Théorie de la Récursivité, Théorie de la ram Recursion theory fast Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
| subject_GND | (DE-588)4122329-9 |
| title | Classical recursion theory the theory of functions and sets of natural numbers |
| title_auth | Classical recursion theory the theory of functions and sets of natural numbers |
| title_exact_search | Classical recursion theory the theory of functions and sets of natural numbers |
| title_full | Classical recursion theory the theory of functions and sets of natural numbers Piergiorgio Odifreddi |
| title_fullStr | Classical recursion theory the theory of functions and sets of natural numbers Piergiorgio Odifreddi |
| title_full_unstemmed | Classical recursion theory the theory of functions and sets of natural numbers Piergiorgio Odifreddi |
| title_short | Classical recursion theory |
| title_sort | classical recursion theory the theory of functions and sets of natural numbers |
| title_sub | the theory of functions and sets of natural numbers |
| topic | Récursivité, Théorie de la Récursivité, Théorie de la ram Recursion theory fast Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
| topic_facet | Récursivité, Théorie de la Recursion theory Rekursionstheorie |
| url | http://www.sciencedirect.com/science/book/9780444502056 |
| work_keys_str_mv | AT odifreddipiergiorgio classicalrecursiontheorythetheoryoffunctionsandsetsofnaturalnumbers |