The formula is just as bogus as it was about a year ago.
Proove it.
Already done. There is no reason for me to repeat myself. You have this thread as reference.
Moreover, as you will admit, you didn't come up with the formulae, and you can't comprehend the formulae, so what point would there be to resurrecting the proof?
Well, actually it was probably Moshe who explained to you that I was pointing out real defects in your formula
I did not write any formula, which calculates the amount of the Distinct States of a given k-Uncertainy x k-Redundancy tree, not before and not now, so what you say is wrong.
Umm, yes, we know that, and you proved my previous comment. But that doesn't change the fact that since you didn't develop the formula, and you don't understand the formula, then it must have been someone else, Moshe in this case, who explained it to you.
We all know that you are incapable of writing any such formula and that you depended on Moshe to write the first couple of bogus versions of it. Nothing you say contradicts what I have said, here.
You never understood the formula nor what was wrong with it.
It was wrong as a general formula because in started from
n>2.
The new formula starts from 0, and because of this fact it is really a general formula that enables to calculate the exact amount of all the Distinct States of a given k-Uncertainty x k-Redundancy tree, after k-Uncertainty x k-Redundancy tree distinct representation was expanded according to your remarks.
Nonsense. It was wrong because it was wrong. It did not offer any method to calculate any case greater than 1 because it was...wrong.
Still this expansion of the Distinct States of a given k-Uncertainty x k-Redundancy tree, provides only the serial case of k-Uncertainty x k-Redundancy tree, which is something that you can't comprehend, because strong simultaneity of symmetric AB superposition, is beyond your reasoning, which is stuck in the level of replacement of distinct ids under Redundancy.
Your method to calculate smaller k-Uncertainty x k-Redundancy trees by using particular cases of bigger k-Uncertainty x k-Redundancy trees, does not provide any information of the real complexity of a given k-Uncertainty x k-Redundancy tree, which is not limited to the amount of the Distinct States under a given tree.
And you jsfisher, can't comprehend it, because your reasoning is based on serial-only reasoning of Distinct States.
So you say, but my methods get the correct answer. Surely that must count for something, no?
Moreover, what have you accomplished so far? Well, you have derived an important generalization of your kXk whatever it is into some significant result.
Hmm, no, you haven't. You have waved your hands a lot, but you have no formal generalization that expands into anything.
Sure, but you at least have the basis for a complete system.
Wrong, again. You have provided only cases that you try to enumerate. There is no operation or scheme that lets us do anything with the cases other than enumerate them.
Well, at least you have provided a method to enumerate all the cases, right?
No, you failed at that as evidenced by your 3X3 case.
So, why is any of this important?
Jsfisher, why do you claim that it is easy to draw by hand any DS of kxk tree?
You are invited to show your simple method that draws any DS of kxk by hand.
But be aware that even if you provide this easy method; it does not provide any information of the complexity of a k-Uncertainty x k-Redundancy tree (known also as Organic Number).
Well, (1) I already did just that, and (2) I revealed that the claimed complexity was really vacuous.