News for hackers. Stuff that matters.
Re:Why Philosophers Should Care About Computational Complexi... by daveFNbuck on Saturday July 21, 2018 @10:19AM (#17582064)
You couldn't use that to compute the busy beaver function, as the busy beaver function asks about Turing machines which have unlimited tape. You can solve it if you have a finite amount of tape, but you'd never know whether one of machines that tried to exceed the limit would have produced a longer output before eventually halting.

There are no comments on this comment yet.