> For large enough n, we can construct a Turing machine that attempts to prove a... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		curryhoward on Feb 17, 2015 \| parent \| context \| favorite \| on: Who Can Name the Bigger Number? > 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 on Feb 17, 2015 [–]

I'm sorry, n was supposed to be the number of states of the Turing machine. I've clarified the original post.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact