Re: A New (And Slightly Stupid) Set Theory

> spot the flaw.

I have detailed the self referential flaw. Defining Russels Set as the
existence of an EXTRA SET is hidiously stupid.

take the set of computable binary expansions, intermixed with non
halting and non decidable procedures.

UTM(1, 0) = 0 0 0
UTM(2, 0) = 0
UTM(3, 0) = 1 1 1 1 1 1 1 1 ..
UTM(4, 0) = 1 0 1 0 1 0 1 0 ...

this is a finite sized program that can run indefinitely for some
appropriate theoretical meaning of the term to_infinity.

The length of the string of 0s and 1s where every possible combination
is covered is infinity. If not, tell me the finite string length
limit?

Therefore the list of bitmasks used on any infinite set will produce
every possible subset. QED

Herc
ps YOU ARE BLIND

.