Publication Date

12-1997

Comments

Technical Report: UTEP-CS-97-36

Published in Cybernetics and Systems: An International Journal, 1999, Vol. 30, No. 5, pp. 429-440.

Abstract

In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics.

Our proof uses a version of Kolmogorov complexity, a technique originally developed to describe randomness and "accidentalness".

Share

COinS