Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
modeless
on Oct 18, 2023
|
parent
|
context
|
favorite
| on:
BB(3, 3) is Hard
So then what's stopping you from running the BB(748) machine, getting the number, then running the ZFC machine and proving ZFC consistent or not?
Kranar
on Oct 18, 2023
[–]
A proof of existence is not the same as a construction, so the fact that we know that there exists a TM that computes BB(748) does not mean that we know which specific TM does it or how to construct such a TM.
Consider applying for YC's W25 batch! Applications are open till Nov 12.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
