
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 concepts of computability, exploring the limits of what can be computed and the relationships between different computational models. It delves into the theoretical underpinnings of computer science, focusing on formalisms that define the boundaries of algorithmic problem-solving.
This work is recognized as a specialized academic text within theoretical computer science, likely appealing to researchers and advanced students. Its focus on formalisms and proofs suggests a dense, rigorous treatment of its subject matter. The 'Research Notes' designation indicates it may present preliminary or in-depth explorations of specific topics rather than a comprehensive overview.
Page Count:
236
Publication Date:
1986-01-01
Publisher:
J. Wiley
ISBN-10:
0273087207
ISBN-13:
9780273087205
No comments yet. Be the first to share your thoughts!