On Oct 29, 11:00 am, Arturo Magidin <magi...@member.ams.org> wrote: > On Sunday, October 28, 2012 7:47:12 PM UTC-5, Graham Cooper wrote: > > On Oct 29, 10:42 am, Arturo Magidin <magi...@member.ams.org> wrote: > > > > Who would waste his or her valuable time doing so > > > > -- > > > > Arturo Magidin > > > TAKES 5 MINUTES YOU * C O W A R D * > > Sorry, but my time is too valuable to waste with the likes of ye. Now, if you are willing to pay my standard consulting fee, I'll be happy to consider it. Until I hear from your legal representative regarding a legally binding offer to do so, please consider my silence the only response you will get. Any further personal attacks from you will be evidence of your unwillingness to put your money where you mouth is. > > -- > Arturo Magidin
My mistake! I assumed by posting a powerset disproof directly under my powerset algorithm you had something to say.
a Universal Turing Machine to generate POWERSET(N).
Every <algorithm, input> pair that terminates populates a value into P(N).
INPUT 1 2 3 4 5 6 7 8 9 10 11 ... =========================================== TM1 H L H H H L L L L L H ... TM2 H H H H H H H H H H H ... TM3 H L L L L L L L L L L ... TM4 H H H H H H H H H H H ... ...
If TM1(1) Halts then 1 e POWERSET_1 If TM1(2) Loops then 2 !e POWERSET_1 If TM2(1) Halts then 1 e POWERSET_2 If TM2(2) Halts then 2 e POWERSET_2 ...
TAKEN FROM THE HALTING VALUES OF THIS EXAMPLE
INPUT 1 2 3 4 5 6 7 8 9 10 11 12 13 14... TM1 H L H TM2 H H H ...
