Get personalized book recommendations based on your reading history and preferences. Our algorithm analyzes your favorite books and reading patterns to suggest your next great read.

The “Church–Turing thesis” category would collect books that explain, develop, or debate the foundational claim in computability theory that any effectively calculable procedure can be carried out by a Turing machine (equivalently, by Church’s lambda calculus). It would include textbooks and monographs on computability and models of computation; introductions to undecidability and the Halting Problem; works on the limits of algorithms and the nature of effective procedures; discussions of the physical and extended theses (connections to physics, AI, cognitive science, and the philosophy of mind); critiques and alternatives such as hypercomputation; popular-science overviews; and historical or biographical studies of Church, Turing, and their intellectual milieu. The unifying focus is the scope and limits of computation and the equivalence of formal models of algorithms.

Filter books by their publication year. Enter the earliest year (Start) and latest year (End) to find books published within that period. Leave either field empty to search from the beginning of time or up to the present day.