Power Search
Low Price Guarantee
We Take School POs
Abstract Recursion and Intrinsic Complexity
Contributor(s): Moschovakis, Yiannis N. (Author)

View larger image

 ISBN: 110841558X     ISBN-13: 9781108415583
Publisher: Cambridge University Press
OUR PRICE: $128.25  

Binding Type: Hardcover - See All Available Formats & Editions
Published: December 2018
Qty:
Temporarily out of stock - Will ship within 2 to 5 weeks

Click for more in this series: Lecture Notes in Logic
Additional Information
BISAC Categories:
- Mathematics | Logic
Dewey: 511.35
LCCN: 2018051435
Series: Lecture Notes in Logic
Physical Information: 0.74" H x 6.18" W x 9.38" L (1.00 lbs) 250 pages
Features: Bibliography, Illustrated, Index, Price on Product
Review Citations: Choice 06/01/2019
 
Descriptions, Reviews, Etc.
Publisher 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.

Contributor Bio(s): Moschovakis, Yiannis N.: - 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.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!