Abstract recursion and intrinsic complexity / Yiannis N. Moschovakis (University of California, Los Angeles, and University of Athens).
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...
Saved in:
| Online Access: |
Full Text (via Cambridge) |
|---|---|
| Main Author: | |
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Cambridge ; New York, NY :
Cambridge University Press,
2019.
|
| Series: | Lecture notes in logic ;
48. |
| Subjects: |
| Summary: | 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. |
|---|---|
| Item Description: | "A publication of the Association for Symbolic Logic." |
| Physical Description: | 1 online resource (vii, 243 pages : illustrations.) |
| Bibliography: | Includes bibliographical references and indexes. |
| ISBN: | 9781108234238 1108234232 |
| DOI: | 10.1017/9781108234238 |
| Source of Description, Etc. Note: | Description based on print version record. |