News for hackers. Stuff that matters.
Re:Why Philosophers Should Care About Computational Complexi... by whatshisface on Saturday July 21, 2018 @08:57AM (#17581820)
If there was an algorithm that produced the busy beaver for a computer of a certian size, you could run it to see how long it would run and then compute the busy beaver function. The busy beaver function grows faster than any computable function[] so that's not possible.

[]https://en.wikipedia.org/wiki/Busy_beaver

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.