logoalt Hacker News

taneqyesterday at 10:53 AM0 repliesview on HN

"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.