Consequence of Goedels theorem
n Showed we can not prove completeness of a
consistent set of arithmetic axioms. There will
be true statements that can not be proven.
n If there existed a general procedure to derive
the minimal Turing machine program for any
sequence, then we would have a procedure to
derive any true proposition from a smaller set
of axioms, contra Goedel.