On Feb 5, 11:01 pm, 1treePetrifiedForestLane <Space...@hotmail.com> wrote: > Russell's paradoxes, mostly, are illinguistic, > essentially not properly tensed. > > the village barber has to go to the next village, > iff he doesn't want to do it, himself.
Is the set of Turing Machines that do not halt yes on themselves recursively enumerable?
If No, then apply that proof to: Is the set of sets that do not contain themselves really a set?
If yes, why do you think that?
If you don't know, then I can prove it is not very easily (using CBL.)