3 ms·
> For large enough n, we can construct a Turing machine that attempts to prove a contradiction in our current most powerful axiomatic system (let's say ZFC). W
by curryhoward 12y ago
> For large enough n, we can construct a Turing machine that attempts to prove a contradiction in our current most powerful axiomatic system (let's say ZFC).
What is n in this construction?
- codeflo 12y agoI'm sorry, n was supposed to be the number of states of the Turing machine. I've clarified the original post.