Abstract Recursion and Intrinsic Complexity
Will be published approx. on 6. December 2018
Book
Hardback
250 pages
978-1-108-41558-3 (ISBN)
Description
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.
Reviews / Votes
'... 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 ClippingsMore details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Product notice
sewn/stitched
Cloth over boards
Illustrations
Worked examples or Exercises; 1 Halftones, black and white; 4 Line drawings, black and white
Dimensions
Height: 238 mm
Width: 157 mm
Thickness: 19 mm
Weight
454 gr
ISBN-13
978-1-108-41558-3 (9781108415583)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Yiannis N. Moschovakis
Abstract Recursion and Intrinsic Complexity
E-Book
12/2018
Cambridge University Press
€112.99
Available for download
Person
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.
Content
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.