Abstract Recursion and Intrinsic Complexity

Explore the intricate world of computation with Abstract Recursion and Intrinsic Complexity by Yiannis N. Moschovakis, published by Cambridge University Press in 2018. This insightful hardback edition spans 250 pages and introduces a groundbreaking framework for understanding the complexity of algorithms. Designed for logicians, computer scientists, mathematicians, and philosophers, this book delves deep into the theory of computation and its foundational principles. With an accessible introduction to abstract recursion theory, readers will find themselves equipped to tackle over 250 engaging problems that reinforce the concepts discussed. Whether you are a seasoned professional or a curious learner, Abstract Recursion and Intrinsic Complexity is an essential addition to your collection, offering valuable insights into the intricate relationship between recursion and complexity in algorithms.