Re: Attempts to Refute Cantor's Uncountability Proof?

Aatu Koskensilta wrote:

Hatto von Aquitanien wrote:
Aatu Koskensilta wrote:

f(1)=c, f(x')=F(x,f(x)), x element of N.

Where x' is the successor of x.

That's the schema of definition by primitive recursion. It's apparent
you just don't know what recursive enumerability means - why not take
the time to find out?

This is roughly what I had in mind.
http://en.wikipedia.org/wiki/Recursively_enumerable_set
"There is an algorithm that "generates" the members of S. That means that
its output is simply a list of the members of S: s1, s2, s3, ... If
necessary it runs forever."

And for the sake of talking about generating .3, .33, .333,..., it is quite
sufficient. The only addition I need to make in order to get my original
point of it producing a bijection with a subset of N is that I need to keep
track of the loop count.
--
Nil conscire sibi
.

Quantcast