Abstract Recursion and Intrinsic Complexity

Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation.

List of contents

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.

About the author

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.

Product details

• Authors: Yiannis N Moschovakis, Yiannis N. Moschovakis, Yiannis N. (University of California Moschovakis, Moschovakis Yiannis N.
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Hardback
• Released: 31.12.2018
• EAN: 9781108415583
• ISBN: 978-1-108-41558-3
• No. of pages: 250
• Series: Lecture Notes in Logic; Lecture Notes in Logic; Lecture Notes in Logic, Series
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > IT; MATHEMATICS / Logic, Mathematical logic