Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

22

CAS
1999

favoriteEmaildiscussreport

60views more CAS 1999»

Coincidences Are not Accidental: a Theorem

13 years 10 months ago

Coincidences Are not Accidental: a Theorem

Download www.cs.utep.edu

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". 1 Coincidences are not Accidental: A Useful Empirical Fact Coincidences happen. In mathematics and physics, discoveries often start when someone notices a strange coincidence. For example:

Vladik Kreinovich

Real-time Traffic

CAS 1999 | Coincidence | Empirical Fact Coincidences | Useful Heuristics |

claim paper

Related Content

» Fingerprint Identification Using the Accidental Coincidence Probability

» A Kleene Theorem for Forest Languages

» Reductions in Circuit Complexity An Isomorphism Theorem and a Gap Theorem

» Fixed points in digital topology via Helly posets

» POVMs and Naimarks Theorem Without Sums

» A Theorem on Higher Bruhat Orders

» Referent Systems and Relational Grammar

» Plottable Real Number Functions and the Computable Graph Theorem

» Quantum Computing Postselection and Probabilistic PolynomialTime

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	CAS
Authors	Vladik Kreinovich

Comments (0)