Synopsis
Classic text considers general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Computability and Unsolvability
Stock Image
Computability and Unsolvability
Published by
McGraw-Hill, 1958
ISBN 10: 0070159106
ISBN 13: 9780070159105
Used
Hardcover
First Edition
Seller: Mythos Center Books, Frontenac, MN, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Used: Very Good. 1st ed. First edition, 1958. Very good in red cloth wtih blue and gilt labels. Computability and Unsolvability by Martin Davis is a classic, advanced undergraduate textbook that introduces the theory of computability, covering topics like recursive functions, Turing machines, and unsolvable problems, with applications in logic and mathematics (like Hilbert's Tenth Problem). First published in 1958, it's considered a foundational text in theoretical computer science, known for its clear exposition and for introducing standard terminology still used today. (amz). Seller Inventory # 15777