Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
noqc
on Oct 17, 2023
|
parent
|
context
|
favorite
| on:
BB(3, 3) is Hard
If BB is a computable function, then you can solve the halting problem by running every turing machine with n states for BB(n), and the ones that don't halt by then don't halt at all.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
