Discover / Book
Turing Computability
Robert I. Soare · 2016 · 299 pages
Computable functions
As an Amazon Associate we earn from qualifying purchases. Some book links are affiliate links; you pay the same price and we may earn a small commission.
About this book
This book emphasizes three very important concepts: computability, as opposed to recursion or induction; classical computability, i.e., algorithmic functions on certain countable structures in the original sense of Turing and Post; and the art of computability, i.e., a skill to be practiced, but also important an esthetic sense of beauty and taste in mathematics.
Appears in these reading paths
The Best Books to Learn Mathematical Logic, In Order
Beginner8books61 hrs5 stages
Reader reviews
Ratings and notes from readers — tagged with how deep into the subject they were.
Loading reviews…