DeepRead
Cover of Computability and logic

About the book

A textbook on computability theory and mathematical logic. It covers Turing machines, abacus-style register machines, and recursive and computable functions, and it shows how these standard models of computation relate to one another. It builds toward Gödel's incompleteness theorems and related results on undecidability and the limits of formal systems. Rather than defending one thesis, the book develops a precise account of effective computation through several equivalent formalisms, and it presents Church's thesis as the link between those formal notions and the intuitive idea of an effective procedure. It then uses this machinery to prove that certain questions, including which sentences are provable in a formal system, cannot be settled by any algorithm. Its central claims are theorems to be proved, including that no consistent formal system strong enough to express basic arithmetic can capture all arithmetic truths.

Written by Claude from what it knows of this book.

What Hacker News says 78% recommend · 0% critical

02.5520102015202020222019 peak · 3
This bookAverage book in Lisp and Scheme

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 7 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
1974
ISBN
9780521701464
Editions known
38 at Open Library
Open Library
OL2721474W

Computable functionsGeneralLogicLogic, Symbolic and mathematicalMathematical foundationsMathematical logicMathematicsPhilosophyPhilosophy / LogicRecursive functionsScience/MathematicsSymbolic and mathematical Logic

Explore in the mosaic

Read next: its neighbours on the mosaic