Abstract recursion and intrinsic complexity
This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2019
|
| Schriftenreihe: | Lecture notes in logic
48 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781108234238 | ||
| 003 | UkCbUP | ||
| 005 | 20181129155429.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 161129s2019||||enk o ||1 0|eng|d | ||
| 020 | |a 9781108234238 | ||
| 100 | 1 | |a Moschovakis, Yiannis N. | |
| 245 | 1 | 0 | |a Abstract recursion and intrinsic complexity |c Yiannis N. Moschovakis |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2019 | |
| 300 | |a 1 Online-Ressource (vii, 243 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Lecture notes in logic |v 48 | |
| 520 | |a This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems. | ||
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781108415583 |
| 856 | 4 | 0 | |l TUM01 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/9781108234238 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781108234238 |
|---|---|
| _version_ | 1818779681293336576 |
| adam_text | |
| any_adam_object | |
| author | Moschovakis, Yiannis N. |
| author_facet | Moschovakis, Yiannis N. |
| author_role | |
| author_sort | Moschovakis, Yiannis N. |
| author_variant | y n m yn ynm |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| doi_str_mv | 10.1017/9781108234238 |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01750nam a2200253 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781108234238</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20181129155429.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">161129s2019||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108234238</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Moschovakis, Yiannis N.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Abstract recursion and intrinsic complexity</subfield><subfield code="c">Yiannis N. Moschovakis</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (vii, 243 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in logic</subfield><subfield code="v">48</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781108415583</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781108234238</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781108234238 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-18T12:04:29Z |
| institution | BVB |
| isbn | 9781108234238 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (vii, 243 Seiten) |
| psigel | ZDB-20-CTM |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Lecture notes in logic |
| spelling | Moschovakis, Yiannis N. Abstract recursion and intrinsic complexity Yiannis N. Moschovakis Cambridge Cambridge University Press 2019 1 Online-Ressource (vii, 243 Seiten) txt c cr Lecture notes in logic 48 This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems. Erscheint auch als Druck-Ausgabe 9781108415583 TUM01 ZDB-20-CTM TUM_PDA_CTM https://doi.org/10.1017/9781108234238 Volltext |
| spellingShingle | Moschovakis, Yiannis N. Abstract recursion and intrinsic complexity |
| title | Abstract recursion and intrinsic complexity |
| title_auth | Abstract recursion and intrinsic complexity |
| title_exact_search | Abstract recursion and intrinsic complexity |
| title_full | Abstract recursion and intrinsic complexity Yiannis N. Moschovakis |
| title_fullStr | Abstract recursion and intrinsic complexity Yiannis N. Moschovakis |
| title_full_unstemmed | Abstract recursion and intrinsic complexity Yiannis N. Moschovakis |
| title_short | Abstract recursion and intrinsic complexity |
| title_sort | abstract recursion and intrinsic complexity |
| url | https://doi.org/10.1017/9781108234238 |
| work_keys_str_mv | AT moschovakisyiannisn abstractrecursionandintrinsiccomplexity |