Hacker News new | ask | show | jobs
by panda-giddiness 1043 days ago
Just express it as an n-state Turing machine and see if it halts within BB(n) steps. /s
1 comments
AnimalMuppet 1043 days ago
And, if n is large enough, then I can retire today.
link