Sidelight: Gödels Thrm

• Any arithmetic system big enough to contain Q will also contain unprovable statements!

  • Q is a subset of number theory

• “This statement is unprovable”

• He used numerical encodings like those for a TM

  • Called Gödel numbers

Previous slide

Next slide

Back to first slide

View graphic version