News for hackers. Stuff that matters.
Re:The Lucas-Penrose Argument about Gödel's Theorem (2012) by pdkl95 on Tuesday May 30, 2017 @01:14PM (#14446810)
> how to program a Turing machine to use "axioms stronger than PA"

http://www.scottaaronson.com/blog/?p=2725

"... a one-tape, two-symbol Turing machine with 7,918 states, whose behavior (when run on a blank tape) can never be proven from the usual axioms of set theory, under reasonable consistency hypotheses."

There are no comments on this comment yet.