Abstract Recursion and Intrinsic Complexity

Inbunden, Engelska, 2018

1 739 kr

Beställningsvara. Skickas inom 11-20 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2018-12-06
Mått:157 x 235 x 18 mm
Vikt:470 g
Format:Inbunden
Språk:Engelska
Serie:Lecture Notes in Logic
Antal sidor:250
Förlag:Cambridge University Press
ISBN:9781108415583

Utforska kategorier

Matematikens grunder inom Naturvetenskap och teknik

Mer om författaren

Yiannis N. Moschovakis is Professor Emeritus and Distinguished Research Professor of Mathematics at the University of California, Los Angeles, and Professor Emeritus at the University of Athens. Among his many professional commendations he is a Fellow of the AMS and a corresponding member of the Academy of Athens. He has received Guggenheim and Sloan Fellowships and has been an invited speaker at the International Congress of Mathematicians. Professor Moschovakis has worked primarily in the theory of recursion, descriptive set theory and the foundations of the theory of algorithms and computation.

Recensioner i media

'… the author presents basic methods, approaches and results of the theory of abstract (ﬁrst-order) recursion and its relevance to the foundations of the theory of algorithms and computational complexity …' Marat M. Arslanov, Mathematical Reviews Clippings

Innehållsförteckning

Introduction; 1. Preliminaries; Part I. Abstract (First Order) Recursion: 2. Recursive (McCarthy) programs; 3. Complexity theory for recursive programs; Part II. Intrinsic Complexity: 4. The homomorphism method; 5. Lower bounds from Presburger primitives; 6. Lower bounds from division with remainder; 7. Lower bounds from division and multiplication; 8. Non-uniform complexity in N; 9. Polynomial nullity (0-testing); References; Symbol index; General index.