principle of computational equivalence | principle of mathematical induction

The principle of computational equivalence states that systems found in the natural world can perform computations up to a maximal ("universal") level of computational power, and that most systems do in fact attain this maximal level of computational power. Consequently, most systems are computationally equivalent.

The principle of mathematical induction states that the truth of an infinite sequence of propositions P_i for i = 1, ..., ∞ is established if (1) P_1 is true and (2) P_k implies P_(k + 1) for all k.

Almost all processes that are not obviously simple can be viewed as computations of equivalent sophistication.

| principle of computational equivalence | principle of mathematical induction formulation date | 2002 (23 years ago) | formulators | Stephen Wolfram | status | open | proved

mathematical principles