The current best result (as far as I could find) is that there exists a $748$-state Turing Machine that halts iff ZFC contains a contradiction. Are there any similar results for other axiom systems, e.g. Peano Arithmetic? The linked source mentions this only as "an excellent [potential] project".



You must log in to answer this question.

Browse other questions tagged .