Check out Tristan's presentation on Turing machines, Gödel encodings, undecidability and incompleteness!


Tristan explains Turing Machines, the concept of Turing universality, the idea that mathematical proofs can embed computations, and goes on to show that that allows one to derive Gödel's incompleteness theorems.

The talk was given at Hamilton Institute student seminar series.