Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
zaarn
on Feb 8, 2023
|
parent
|
context
|
favorite
| on:
The Busy Beaver Challenge
The tape under the turing machine is infinite, so it's certainly not limited to 47M states. The conjecture states that all machines that halt will do so within 47M states.
schoen
on Feb 8, 2023
[–]
Steps rather than states.
Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
