News for hackers. Stuff that matters.
Re:The Point of the Banach-Tarski Theorem – not just a curio... by black_knight on Sunday June 07, 2015 @06:58PM (#9676635)
If one uses classical logic there are even many countable, even finite sets which are beyond computable distinction. The set of computable functions on say natural numbers is a countable set, but even distinguishing when two such are equal cannot be effectively done.

The solution is either to distinguish between countable and enumerable and decidable, or to use intuitionistic logic.

There are no comments on this comment yet.