
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 resources required to solve problems. Alan L. Selman, a noted researcher in theoretical computer science, presents a comprehensive exploration of computability theory, which deals with what problems can be solved by algorithms, and complexity theory, which classifies problems based on their difficulty. The work delves into concepts such as Turing machines, recursive functions, and the P versus NP problem, examining the theoretical underpinnings of computational power and efficiency.
This text is recognized as a rigorous and in-depth treatment of computability and complexity theory, suitable for advanced undergraduate and graduate students in computer science and mathematics. Its coverage of foundational concepts and contemporary research makes it a valuable resource for those seeking a solid theoretical grounding in the field. The book is noted for its clear exposition of complex topics and its comprehensive scope.
Page Count:
316
Publication Date:
2011-01-01
ISBN-10:
1461406811
ISBN-13:
9781461406815
No comments yet. Be the first to share your thoughts!