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” as a book category would collect works on the foundations and limits of computation, centered on the claim that all effectively calculable processes are captured by equivalent formal models such as Turing machines, lambda calculus, and recursive functions. It would include textbooks and monographs in computability and automata theory; philosophical analyses of algorithms, effective procedures, and the nature of mechanistic reasoning; and historical or biographical studies of Alan Turing, Alonzo Church, and their intellectual context. Typical topics would cover model equivalence, undecidability and the halting problem, the boundary between computable and non-computable tasks, and the thesis’s status as a conceptual (not purely mathematical) claim. The category would also house discussions of variants and extensions—like the physical Church–Turing thesis, the Church–Turing–Deutsch principle, quantum and analog computation, and debates over hypercomputation—and their implications for computer science, physics, AI, cognitive science, and programming languages. Accessible introductions and popular science overviews that explain these ideas for general readers would fit here as well.

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.