> Therefore, there is a smallest such program that's independent of ZFC. http://www.scottaaronson.com/blog/?p=2725 http://www.scottaaronson.com/blog/?p=2725

> Therefore, there is a smallest such program that's independent of ZFC. http://www.scottaaronson.com/blog/?p=2725 http://www.scottaaronson.com/blog/?p=2725 we give a 7,918-state Turing machine, called Z (and actually explicitly listed in our paper!), such that: Z runs forever, assuming the consistency of a large-cardinal theory called SRP (Stationary Ramsey Property), but Z can’t be proved to run forever in ZFC [...], assuming that ZFC is consistent. edit: Just saw that this was linked at the bottom of the article. As pohl mentioned, the article really buried the lede.