concept
active
concept:godel-s-incompleteness-theorems

Gödel's Incompleteness Theorems

Shows formal systems with self-reference must be incomplete; analogized to Turing's halting problem.

Neighborhood — ranked by edge-count

Thinkers (1)

thinker
  • Kurt Gödel
    introduces
    Proved incompleteness theorem showing Principia's formalist program could not succeed; cited for implications on computationalism

Concepts (1)

concept
  • Halting Problem
    analogous_to
    Undecidability of whether an arbitrary program halts, discussed as a self-referential limit of computation.

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.