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

"We should have solved Busy Beaver, if the complexity of BB(n) is finite this is possible."

I mean yeah, chess isn't THAT bad but still not directly tractable and besides, brute forcing it is boring.



Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10

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

Search: