> HERE IS A LOWER ENTROPY COUNTABLE SET OF REALS > > 0.000000.. 0.110000.. 0.111010.. 0.111110.. ... > 0.000111.. 0.101000.. 0.000010.. 0.001100.. ... > 0.111000.. 0.010010.. 0.001010.. 0.101010.. ... > 0.111100.. 0.001011.. 0.000011.. 0.111111.. ... > ... >
Look you can dodge every question and claim
CANTORS PROOF HAS STOOD UP TO EVERY ATTACK
but you've got your head in the sand!
Cantors proof fails every attack, logic, data structure, formal proof, resolution, definitions, semantics, probability, .. , ... ,...
...
THESE NEVER GET ANSWERED!
tinyurl.com/blueprints-questions
***************************************************** ***************************************************** Q4 How can there be uncountable many GODEL NUMBERS like this?
20130415 a01(0,1) MIDPOINT(0,1) A CHOICE FUNCTION
***************************************************** ***************************************************** Q5 Which 1 of these does not hold?
a) N <-BIJECTS-> GODEL NUMBERS b) GODEL NUMBERS <-BIJECT-> FUNCTIONS c) FUNCTIONS <-BIJECT-> CHIOCE FUNCTIONS d) CHOICE FUNCTIONS <-BIJECT-> SETS e) |SETS| > |N|
????
***************************************************** ***************************************************** Q6 Does this Anti-Diagonal Method produce any unique digit segment not listed?
AD METHOD Choose the number 0.a_1a_2a_3...., where a_i = 1 if the i-th number in your list had zero in its i-position, a_i = 0 otherwise.
