Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
l33t7332273
on Oct 17, 2023
|
parent
|
context
|
favorite
| on:
BB(3, 3) is Hard
Excuse me?
dullcrisp
on Oct 18, 2023
[–]
I’m saying that all you’ve proven is that if you know a priori whether ZFC is consistent, you can construct a Turing machine that returns this value. If you consider that to be window dressing I don’t know what else I can tell you.
l33t7332273
on Oct 18, 2023
|
parent
[–]
I’m saying that it doesn’t matter if you know if ZFC is consistent; I have proven there exists a TM that halts iff it is.
Consider applying for YC's W25 batch! Applications are open till Nov 12.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
