News for hackers. Stuff that matters.
Re:How the Slowest Computer Programs Illuminate Math’s Funda... by chalst on Friday December 11, 2020 @06:56AM (#25384750)
On his interpretation of constructivism, there are no mathematical constructions that are in principle non-computable. The proof that a function satisfying the property of "busy-beaverness" couldn't be computed thus is proof that the property does not determine a total function, so the classical definition is rejected as a non-constructive gesture at infinity.

There are no comments on this comment yet.