3 ms·
> and check each. "Now, draw the rest of the owl." Not saying you're wrong, just, this jump is super non-obvious even to most mathematicians.
by klyrs 3y ago
> and check each.
"Now, draw the rest of the owl." Not saying you're wrong, just, this jump is super non-obvious even to most mathematicians.
- CaptainNegative 3y agoIf 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.