Paradoxes of Completeness, Definability and Computation

I wrote and animated this video about Gödel’s incompleteness theorems, Richard’s paradox, and Turing’s solution to the Entscheidungsproblem.

The proofs use a similar line of reasoning. I wanted to show that connection and explain each proof without assuming much background in logic.

I used animation to make the steps easier to follow.