Re: Attempts to Refute Cantor's Uncountability Proof?

Aatu Koskensilta wrote:

Hatto von Aquitanien wrote:
The definition of N uses recursive enumeration. Any bijection to N is
recursively enumerable.

Well, no.

How can that *possibly* be true? N is recursively enumerable. The
definition of recursive enumerability might as well be - and in some
instances is given as - a bijection to N.
--
Nil conscire sibi
.

Quantcast