zlacker

[parent] [thread] 1 comments
1. curryh+(OP)[view] [source] 2015-02-17 00:26:09
> 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?

replies(1): >>codefl+h
◧
2. codefl+h[view] [source] 2015-02-17 00:29:55
>>curryh+(OP)
I'm sorry, n was supposed to be the number of states of the Turing machine. I've clarified the original post.
[go to top]