
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Author description coming soon. We're reaching out to them in the ether...
This book investigates the fundamental limits of computation and the nature of algorithms. It explores the theoretical underpinnings of what can and cannot be computed, examining formal models of computation such as Turing machines and recursive functions. The text delves into the concepts of undecidability and complexity, providing a rigorous framework for understanding the capabilities and limitations of computing systems.
Enderton's 'Computability Theory' is recognized as a foundational text in theoretical computer science and mathematical logic. It is valued for its clear exposition of complex concepts and its rigorous mathematical approach. The book is typically recommended for advanced undergraduate and graduate students in computer science and mathematics seeking a deep understanding of computability.
Page Count:
0
Publication Date:
2011-01-01
ISBN-10:
0123849586
ISBN-13:
9780123849588
No comments yet. Be the first to share your thoughts!