doronshadmi
Penultimate Amazing
- Joined
- Mar 15, 2008
- Messages
- 13,320
There can be finitely or infinitely many operators of all kinds on finitely or infinitely many arranged levels that simply are calculated in one step, called parallel-summation.If the basis of your proof depends on the existence of a parallel-summation operator, how is it defined mathematically? I can't analyze your proof beyond this point without a meaningful description of a parallel-summation.
Please think about parallel-summation more in terms of synthesis (more like parallel thinking) and less in terms of analysis (less like serial thinking).
Last edited: