Abstract Recursion and Intrinsic Complexity

by Yiannis N. Moschovakis

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...

• Format: Hardcover
• Language: English
• ISBN: 110841558X
• ISBN13: 9781108415583
• Release Date: February 2019
• Publisher: Cambridge University Press
• Length: 250 Pages
• Weight: 1.00 lbs.
• Dimensions: 0.7" x 6.2" x 9.4"