0
Write a program whose termination is independent of Peano arithmetic.
More formally: one can, in principle, convert some Universal Turing machine U (e.g. your favorite programming language) into a Peano arithmetic formula HALT over the variable p, where HALT(p) encodes the proposition “U termina...