Combinatorial hierarchy
From Wikipedia, the free encyclopedia
The Combinatorial Hierarchy is a mathematical structure of bit-strings generated by an algorithm based on discrimination (exclusive-or between bits). It was originally discovered by A.F. Parker-Rhodes in 1964, and is interesting because of physical interpretations that relate it to quantum mechanics.[1] For example, values close to the fine structure constant and the proton-mass gravitational coupling constant appear in the generation of the Hierarchy.[1]
See also
Notes
- ↑ 1.0 1.1 Bastin, Ted and Kilmister, C.W. Combinatorial Physics. World Scientific, 1995, ISBN 981-02-2212-2
References
- A formal development of the combinatorial hierarchy in terms of group theory appears in the appendix to "On the physical interpretation and the mathematical structure of the combinatorial hierarchy," Int. Journ. Theor. Phys. 18, 7 (1979) 445.
- Theory of Indistinguishables, A.F. Parker-Rhodes, Reidel, 1981.
- Journal of the Western Regional Chapter of the Alternative Natural Philosophy Association
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.