• Quick note - the problem with Youtube videos not embedding on the forum appears to have been fixed, thanks to ZiprHead. If you do still see problems let me know.

Deeper than primes

Status
Not open for further replies.
It's all finished, but you've told me my work was all wrong.
It is wrong because it uses F and DS of greater k x k tree in order to define the amount of DS of smaller k x k tree by ignoring uncertainty, which appears also in the greater k x k tree and so on ... ad infinitum.

So your view of this subject is limited.

Any way you did not define the general formula "For the purposes of counting" by your combinations with repetition method.
 
Are you suggesting Complexity is in the Q category of GLBTQ? I don't think so. He has been clear on his preferences.

If you are uncertain, perhaps you should seek his council.

jsfisher said:
Your AB symbol behaves exactly as does my C symbol, but you can't see that, can you?
Your C symbol does not behave exactly as does my AB symbol, because AB is a symbol for Uncertainty and C is a symbol fo Certainty.

Certainty and Uncertainty are two different qualities that are not the same exactly as a point and a line are two qualities that are not the same, for example:

Uncertainty ≠ Certainty

Line ≠ Point

What you are doing is this:

Uncertainty < = = > Certainty

Line < = = > Point

But:

(Uncertainty < = = > Certainty) ≠ (Uncertainty ≠ Certainty)

(Line < = = > Point) ≠ (Line ≠ Point)

and you still do not get it.
 
Last edited:
Your C symbol does not behave exactly as does my AB symbol, because AB is a symbol for Uncertainty and C is a symbol fo Certainty.

Certainty and Uncertainty are two different qualities that are not the same exactly as a point and a line are two qualities that are not the same, for example:

Uncertainty ≠ Certainty

Line ≠ Point

What you are doing is this:

Uncertainty < = = > Certainty

Line < = = > Point

But:

(Uncertainty < = = > Certainty) ≠ (Uncertainty ≠ Certainty)

(Line < = = > Point) ≠ (Line ≠ Point)

and you still do not get it.

He is so focused on his crap. Can't even understand a joke or maybe it is English he does not understand. Very sad for him anyway.
 
He is so focused on his crap. Can't even understand a joke or maybe it is English he does not understand. Very sad for him anyway.


It is a combination of sharp focus and an overwhelming desire to contradict. His stuff must stand as correct, and everything else must be dismissed as wrong...at all cost.

With "it's wrong" or "you're wrong" as a primary goal, there is little use wasting time with reading comprehension. He already knows the conclusion he wants.
 
jsfisher said:
...and are you ever going to correct your 3X3 case?

Already corrected (by adding (C,C,AB), (C,C,AC) and (C,C,BC)) both in
http://www.internationalskeptics.com/forums/showpost.php?p=5934321&postcount=9831 and http://www.internationalskeptics.com/forums/showpost.php?p=5953576&postcount=9891 .

Yet there are more DS under F (1,1,1,0,0,0,0,0) of 8x8 tree than all the DS under 3x3 tree, as can be seen in http://www.internationalskeptics.com/forums/showpost.php?p=5953576&postcount=9891 .

You are invited to provide the missing DS of 3x3 tree in order to show the 1-to-1 correspondence between all the DS under F (1,1,1,0,0,0,0,0) of 8x8 tree and all the DS under 3x3 tree.

Another option is that I have added too many (or even missed some of the) DS of F (1,1,1,0,0,0,0,0) of 8x8 tree.

If nothing is wrong in the mapping in http://www.internationalskeptics.com/forums/showpost.php?p=5953576&postcount=9891 , then your method fails at 3x3 case.

So please try to show the correct detailed 1-to-1 correspondence between all the DS under F (1,1,1,0,0,0,0,0) of 8x8 tree and all the DS under 3x3 tree, by using http://www.internationalskeptics.com/forums/showpost.php?p=5953576&postcount=9891.
 
Last edited:


Is that all you are going to fix?

One would have to conclude that being right or wrong doesn't matter...and that would be evidence this whole kXk blunder of yours is without significance.

Will you be reaching this conclusion anytime soon? The rest of us are waiting for you to catch up.
 
Is that all you are going to fix?

One would have to conclude that being right or wrong doesn't matter...and that would be evidence this whole kXk blunder of yours is without significance.

Will you be reaching this conclusion anytime soon? The rest of us are waiting for you to catch up.

Here is the last fixed version of 3x3 tree ( I missed DS under F (2,2,2) , F (2,2,1) and F (2,2,0) ). But now there are less elements according to your method. Can you find them?:

Code:
<A,A,A> < = = > (ABC,ABC,ABC)
<A,A,B> < = = > (ABC,ABC,AB)
<A,A,C> < = = > (ABC,ABC,AC)
<A,A,D> < = = > (ABC,ABC,BC)
<A,A,E> < = = > (ABC,ABC,A)
<A,A,F> < = = > (ABC,ABC,B)
<A,A,G> < = = > (ABC,ABC,C)
<A,A,H> < = = > (ABC,ABC)
<B,B,A> < = = > (ABC,AB,AB)
<B,B,B> < = = > (ABC,AB,AC)
<B,B,C> < = = > (ABC,AB,BC)
<B,B,D> < = = > (ABC,AC,AC)
<B,B,E> < = = > (ABC,BC,BC)
<B,B,F> < = = > (ABC,AB,A)
<B,B,G> < = = > (ABC,AB,B)
<B,B,H> < = = > (ABC,AB,C)
<C,C,A> < = = > (ABC,AC,A)
<C,C,B> < = = > (ABC,AC,B)
<C,C,C> < = = > (ABC,AC,C)
<C,C,D> < = = > (ABC,BC,A)
<C,C,E> < = = > (ABC,BC,B)
<C,C,F> < = = > (ABC,BC,C)
<C,C,G> < = = > (ABC,AB)
<C,C,H> < = = > (ABC,AC)
<D,D,A> < = = > (ABC,BC)
<D,D,B> < = = > (AB,AB,AB)
<D,D,C> < = = > (AB,AB,AC)
<D,D,D> < = = > (AB,AC,AC)
<D,D,E> < = = > (AC,AC,AC)
<D,D,F> < = = > (AB,AB,BC)
<D,D,G> < = = > (AB,AC,BC)
<D,D,H> < = = > (AB,BC,BC)
<E,E,A> < = = > (AC,AC,BC)
<E,E,B> < = = > (AC,BC,BC)
<E,E,C> < = = > (BC,BC,BC)
<E,E,D> < = = > (AB,AB,A)
<E,E,E> < = = > (AB,AC,A)
<E,E,F> < = = > (AB,BC,A)
<E,E,G> < = = > (AC,AC,A)
<E,E,H> < = = > (AC,BC,A)
<F,F,A> < = = > (BC,BC,A)
<F,F,B> < = = > (AB,AB,B)
<F,F,C> < = = > (AB,AC,B)
<F,F,D> < = = > (AB,BC,B)
<F,F,E> < = = > (AC,AC,B)
<F,F,F> < = = > (AC,BC,B)
<F,F,G> < = = > (BC,BC,B)
<F,F,H> < = = > (AB,AB,C)
<G,G,A> < = = > (AB,AC,C)
<G,G,B> < = = > (AB,BC,C)
<G,G,C> < = = > (AC,AC,C)
<G,G,D> < = = > (AC,BC,C)
<G,G,E> < = = > (BC,BC,C)
<G,G,F> < = = > (AB,AB)
<G,G,G> < = = > (AB,AC)
<G,G,H> < = = > (AB,BC)
<H,H,A> < = = > (AC,AC)
<H,H,B> < = = > (AC,BC)
<H,H,C> < = = > (BC,BC)
<H,H,D> < = = > (A,A,ABC)
<H,H,E> < = = > (B,B,ABC)
<H,H,F> < = = > (A,B,ABC)
<H,H,G> < = = > (A,C,ABC)
<H,H,H> < = = > (B,C,ABC)
<A,B,C> < = = > (ABC,A)
<A,B,D> < = = > (ABC,B)
<A,B,E> < = = > (ABC,C)
<A,B,F> < = = > (ABC)
<A,B,G> < = = > (A,A,AB)
<A,B,H> < = = > (A,A,AC)
<A,C,D> < = = > (A,A,BC)
<A,C,E> < = = > (B,B,AB)
<A,C,F> < = = > (B,B,AC)
<A,C,G> < = = > (B,B,BC)
<A,C,H> < = = > (C,C,AB)
<A,D,E> < = = > (C,C,AC)
<A,D,F> < = = > (C,C,BC)
<A,D,G> < = = > (A,B,AB)
<A,D,H> < = = > (A,B,AC)
<A,E,F> < = = > (A,B,BC)
<A,E,G> < = = > (A,C,AB)
<A,E,H> < = = > (A,C,AC)
<A,F,G> < = = > (A,C,BC)
<A,F,H> < = = > (B,C,AB)
<B,C,D> < = = > (B,C,AC)
<B,C,E> < = = > (B,C,BC)
<B,C,F> < = = > (AB,A)
<B,C,G> < = = > (AB,B)
<B,C,H> < = = > (AB,C)
<B,D,E> < = = > (AC,A)
<A,D,F> < = = > (AC,B)
<B,D,G> < = = > (AC,C)
<B,D,H> < = = > (BC,A)
<B,E,F> < = = > (BC,B)
<B,E,G> < = = > (BC,C)
<B,E,H> < = = > (AB)
<B,F,G> < = = > (AC)
<B,F,H> < = = > (BC)
<C,D,E> < = = > (A,A,A)
<C,D,F> < = = > (B,B,B)
<C,D,G> < = = > (C,C,C)
<C,D,H> < = = > (A,A,B)
<C,E,F> < = = > (A,A,C)
<C,E,G> < = = > (B,B,A)
<C,E,H> < = = > (B,B,C)
<C,F,G> < = = > (C,C,A)
<C,F,H> < = = > (C,C,B)
<D,F,H> < = = > (A,B,C)
                (A,A)
                (B,B)
                (C,C)
                (A,B)
                (A,C)
                (C,B)
                (A)
                (B)
                (C)
                ()

3X3 tree:

(3,3,3) = (ABC,ABC,ABC)
(3,3,2) = (ABC,ABC,AB),(ABC,ABC,AC),(ABC,ABC,BC)
(3,3,1) = (ABC,ABC,A),(ABC,ABC,B),(ABC,ABC,C)
(3,3,0) = (ABC,ABC)
(3,2,2) =
(ABC,AB,AB),(ABC,AB,AC),(ABC,AB,BC)
(ABC,AC,AC),(ABC,BC,BC)
(3,2,1) =
(ABC,AB,A),(ABC,AB,B),(ABC,AB,C)
(ABC,AC,A),(ABC,AC,B),(ABC,AC,C)
(ABC,BC,A),(ABC,BC,B),(ABC,BC,C)
(3,2,0) = (ABC,AB),(ABC,AC),(ABC,BC)
(2,2,2) =
(AB,AB,AB)
(AB,AB,AC)
(AB,AC,AC)
(AC,AC,AC)
(AB,AB,BC)
(AB,AC,BC)
(AB,BC,BC)
(AC,AC,BC)
(AC,BC,BC)
(BC,BC,BC)
(2,2,1) =
(AB,AB,A)
(AB,AC,A)
(AB,BC,A)
(AC,AC,A)
(AC,BC,A)
(BC,BC,A)
(AB,AB,B)
(AB,AC,B)
(AB,BC,B)
(AC,AC,B)
(AC,BC,B)
(BC,BC,B)
(AB,AB,C)
(AB,AC,C)
(AB,BC,C)
(AC,AC,C)
(AC,BC,C)
(BC,BC,C)
(2,2,0) =
(AB,AB)
(AB,AC)
(AB,BC)
(AC,AC)
(AC,BC)
(BC,BC)
(1,1,3) =
(A,A,ABC),(B,B,ABC),(A,B,ABC)
(A,C,ABC),(B,C,ABC)
(3,1,0) = (ABC,A),(ABC,B),(ABC,C)
(3,0,0) = (ABC)
(1,1,2) =
(A,A,AB),(A,A,AC),(A,A,BC)
(B,B,AB),(B,B,AC),(B,B,BC)
(C,C,AB),(C,C,AC),(C,C,BC)
(A,B,AB),(A,B,AC),(A,B,BC)
(A,C,AB),(A,C,AC),(A,C,BC)
(B,C,AB),(B,C,AC),(B,C,BC)
(2,1,0) = (AB,A),(AB,B),(AB,C),(AC,A),(AC,B),(AC,C),(BC,A),( BC,B),(BC,C)
(2,0,0) = (AB),(AC),(BC)
(1,1,1) =
(A,A,A),(B,B,B),(C,C,C)
(A,A,B),(A,A,C),(B,B,A)
(B,B,C),(C,C,A),(C,C,B),(A,B,C)
(1,1,0) = (A,A),(B,B),(C,C),(A,B),(A,C),(C,B)
(1,0,0) = (A),(B),(C)
(0,0,0) = ()
 
Last edited:
that's putting it mildldy. He is obsessed. That's why we will never be able to explain how wrong he is.

sympathic you are obsessed to reduce everything into sharp forms.

As a result all you get is sums.

Since you are an expert of sharp forms, maybe you can halp jsfisher to find the missing forms in my latest correction (now there are 11 DS of 3x3 tree that are not covered by the DS of F (1,1,1,0,0,0,0,0) under 8x8 tree):

Here is the last fixed version of 3x3 tree ( I missed DS under F (3,2,2) , F (2,2,2) , F (2,2,1) and F (2,2,0) ). But now there are less elements according to jsfisher's method. Can you find them?:

Code:
<A,A,A> < = = > (ABC,ABC,ABC)
<A,A,B> < = = > (ABC,ABC,AB)
<A,A,C> < = = > (ABC,ABC,AC)
<A,A,D> < = = > (ABC,ABC,BC)
<A,A,E> < = = > (ABC,ABC,A)
<A,A,F> < = = > (ABC,ABC,B)
<A,A,G> < = = > (ABC,ABC,C)
<A,A,H> < = = > (ABC,ABC)  
<B,B,A> < = = > (ABC,AB,AB)
<B,B,B> < = = > (ABC,AB,AC)
<B,B,C> < = = > (ABC,AB,BC)
<B,B,D> < = = > (ABC,AC,AC)
<B,B,E> < = = > (ABC,AC,BC)
<B,B,F> < = = > (ABC,BC,BC)
<B,B,G> < = = > (ABC,AB,A) 
<B,B,H> < = = > (ABC,AB,B) 
<C,C,A> < = = > (ABC,AB,C) 
<C,C,B> < = = > (ABC,AC,A) 
<C,C,C> < = = > (ABC,AC,B) 
<C,C,D> < = = > (ABC,AC,C) 
<C,C,E> < = = > (ABC,BC,A) 
<C,C,F> < = = > (ABC,BC,B) 
<C,C,G> < = = > (ABC,BC,C) 
<C,C,H> < = = > (ABC,AB)   
<D,D,A> < = = > (ABC,AC)   
<D,D,B> < = = > (ABC,BC)   
<D,D,C> < = = > (AB,AB,AB) 
<D,D,D> < = = > (AB,AB,AC) 
<D,D,E> < = = > (AB,AC,AC) 
<D,D,F> < = = > (AC,AC,AC) 
<D,D,G> < = = > (AB,AB,BC) 
<D,D,H> < = = > (AB,AC,BC) 
<E,E,A> < = = > (AB,BC,BC) 
<E,E,B> < = = > (AC,AC,BC) 
<E,E,C> < = = > (AC,BC,BC) 
<E,E,D> < = = > (BC,BC,BC) 
<E,E,E> < = = > (AB,AB,A)  
<E,E,F> < = = > (AB,AC,A)  
<E,E,G> < = = > (AB,BC,A)  
<E,E,H> < = = > (AC,AC,A)  
<F,F,A> < = = > (AC,BC,A)  
<F,F,B> < = = > (BC,BC,A)  
<F,F,C> < = = > (AB,AB,B)  
<F,F,D> < = = > (AB,AC,B)  
<F,F,E> < = = > (AB,BC,B)  
<F,F,F> < = = > (AC,AC,B)  
<F,F,G> < = = > (AC,BC,B)  
<F,F,H> < = = > (BC,BC,B)  
<G,G,A> < = = > (AB,AB,C)  
<G,G,B> < = = > (AB,AC,C)  
<G,G,C> < = = > (AB,BC,C)  
<G,G,D> < = = > (AC,AC,C)  
<G,G,E> < = = > (AC,BC,C)  
<G,G,F> < = = > (BC,BC,C)  
<G,G,G> < = = > (AB,AB)    
<G,G,H> < = = > (AB,AC)    
<H,H,A> < = = > (AB,BC)    
<H,H,B> < = = > (AC,AC)    
<H,H,C> < = = > (AC,BC)    
<H,H,D> < = = > (BC,BC)    
<H,H,E> < = = > (A,A,ABC)  
<H,H,F> < = = > (B,B,ABC)  
<H,H,G> < = = > (A,B,ABC)  
<H,H,H> < = = > (A,C,ABC)  
<A,B,C> < = = > (B,C,ABC)  
<A,B,D> < = = > (ABC,A)    
<A,B,E> < = = > (ABC,B)    
<A,B,F> < = = > (ABC,C)    
<A,B,G> < = = > (ABC)      
<A,B,H> < = = > (A,A,AB)   
<A,C,D> < = = > (A,A,AC)   
<A,C,E> < = = > (A,A,BC)   
<A,C,F> < = = > (B,B,AB)   
<A,C,G> < = = > (B,B,AC)   
<A,C,H> < = = > (B,B,BC)   
<A,D,E> < = = > (C,C,AB)   
<A,D,F> < = = > (C,C,AC)   
<A,D,G> < = = > (C,C,BC)   
<A,D,H> < = = > (A,B,AB)   
<A,E,F> < = = > (A,B,AC)   
<A,E,G> < = = > (A,B,BC)   
<A,E,H> < = = > (A,C,AB)   
<A,F,G> < = = > (A,C,AC)   
<A,F,H> < = = > (A,C,BC)   
<B,C,D> < = = > (B,C,AB)   
<B,C,E> < = = > (B,C,AC)   
<B,C,F> < = = > (B,C,BC)   
<B,C,G> < = = > (AB,A)     
<B,C,H> < = = > (AB,B)     
<B,D,E> < = = > (AB,C)     
<A,D,F> < = = > (AC,A)     
<B,D,G> < = = > (AC,B)     
<B,D,H> < = = > (AC,C)     
<B,E,F> < = = > (BC,A)     
<B,E,G> < = = > (BC,B)     
<B,E,H> < = = > (BC,C)     
<B,F,G> < = = > (AB)       
<B,F,H> < = = > (AC)       
<C,D,E> < = = > (BC)       
<C,D,F> < = = > (A,A,A)    
<C,D,G> < = = > (B,B,B)    
<C,D,H> < = = > (C,C,C)    
<C,E,F> < = = > (A,A,B)    
<C,E,G> < = = > (A,A,C)    
<C,E,H> < = = > (B,B,A)    
<C,F,G> < = = > (B,B,C)    
<C,F,H> < = = > (C,C,A)    
<D,F,H> < = = > (C,C,B)    
                (A,B,C)    
                (A,A)      
                (B,B)      
                (C,C)      
                (A,B)      
                (A,C)      
                (C,B)      
                (A)        
                (B)        
                (C)        
                ()


3X3 tree:

(3,3,3) = (ABC,ABC,ABC)
(3,3,2) = (ABC,ABC,AB),(ABC,ABC,AC),(ABC,ABC,BC)
(3,3,1) = (ABC,ABC,A),(ABC,ABC,B),(ABC,ABC,C)
(3,3,0) = (ABC,ABC)
(3,2,2) =
(ABC,AB,AB)
(ABC,AB,AC)
(ABC,AB,BC)
(ABC,AC,AC)
(ABC,AC,BC)
(ABC,BC,BC)
(3,2,1) =
(ABC,AB,A),(ABC,AB,B),(ABC,AB,C)
(ABC,AC,A),(ABC,AC,B),(ABC,AC,C)
(ABC,BC,A),(ABC,BC,B),(ABC,BC,C)
(3,2,0) = (ABC,AB),(ABC,AC),(ABC,BC)
(2,2,2) =
(AB,AB,AB)
(AB,AB,AC)
(AB,AC,AC)
(AC,AC,AC)
(AB,AB,BC)
(AB,AC,BC)
(AB,BC,BC)
(AC,AC,BC)
(AC,BC,BC)
(BC,BC,BC)
(2,2,1) =
(AB,AB,A)
(AB,AC,A)
(AB,BC,A)
(AC,AC,A)
(AC,BC,A)
(BC,BC,A)
(AB,AB,B)
(AB,AC,B)
(AB,BC,B)
(AC,AC,B)
(AC,BC,B)
(BC,BC,B)
(AB,AB,C)
(AB,AC,C)
(AB,BC,C)
(AC,AC,C)
(AC,BC,C)
(BC,BC,C)
(2,2,0) =
(AB,AB)
(AB,AC)
(AB,BC)
(AC,AC)
(AC,BC)
(BC,BC)
(1,1,3) =
(A,A,ABC),(B,B,ABC),(A,B,ABC)
(A,C,ABC),(B,C,ABC)
(3,1,0) = (ABC,A),(ABC,B),(ABC,C)
(3,0,0) = (ABC)
(1,1,2) =
(A,A,AB),(A,A,AC),(A,A,BC)
(B,B,AB),(B,B,AC),(B,B,BC)
(C,C,AB),(C,C,AC),(C,C,BC)
(A,B,AB),(A,B,AC),(A,B,BC)
(A,C,AB),(A,C,AC),(A,C,BC)
(B,C,AB),(B,C,AC),(B,C,BC)
(2,1,0) = (AB,A),(AB,B),(AB,C),(AC,A),(AC,B),(AC,C),(BC,A),( BC,B),(BC,C)
(2,0,0) = (AB),(AC),(BC)
(1,1,1) =
(A,A,A),(B,B,B),(C,C,C)
(A,A,B),(A,A,C),(B,B,A)
(B,B,C),(C,C,A),(C,C,B),(A,B,C)
(1,1,0) = (A,A),(B,B),(C,C),(A,B),(A,C),(C,B)
(1,0,0) = (A),(B),(C)
(0,0,0) = ()
 
Last edited:
Status
Not open for further replies.

Back
Top Bottom