|
|
|
|
|
|
by CaptainNegative
966 days ago
|
|
|
If you can check any given bitstring for whether it encodes a valid ZFC proof of the (in)consistency of ZFC in finite time, then you can write a program to enumerate over all possible bit strings in shortlex order and halt the first time you see a valid proof. |
|
|