Sign inSign in
ConceptAI & ML

Gödel's first incompleteness theorem

In any reasonable formal system of mathematical provability, there are some true statements that are not provable.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Formal system3Arithmetic systems1Provability1Recursion theorem1Turing machine1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Jim Harris

    National Capital Area Skeptics (NCAS) · Undergraduate

    Consistent arithmetic systems contain true statements that are unprovable or disprovable within them.
    • 30:00Mythbusting AI: Understanding Large Language Models and Their Limitations

Connections

5

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.