 Computational irreducibility

Computational irreducibility is one of the main ideas proposed by Stephen Wolfram in his book A New Kind of Science.
Contents
The idea
Wolfram terms the inability to shortcut a program (e.g., a system), or otherwise describe its behavior in a simple way, "computational irreducibility". The empirical fact is that the world of simple programs contains a great diversity of behavior, but, because of undecidability, it is impossible to predict what they will do before essentially running them. The idea demonstrates that there are occurrences where theory's predictions are effectively not possible. Wolfram states several phenomena are normally computationally irreducible.
Computational irreducibility explains observed limitations of existing mainstream science. In cases of computational irreducibility, only observation and experiment can be used. Computational irreducibility may also provide a scientific based resolution for free will.
Implications
 Nearly no easy theory for any behavior that seems complex.
 Complex behavior features can be captured with models that have simple underlying structures.
 An overall system's behavior based on simple structures can still exhibit behavior undescribeable by reasonably "simple" laws.
Analysis
Israeli and Goldenfeld found that some less complex systems behaved simply and predictably (thus, they allowed approximations). However, more complex systems were still computationally irreducible and unpredictable. It is unknown what conditions would allow complex phenomena to be described simply and predictably.
See also
 Chaos theory
 Gödel’s Theorem
 Computation
 Principle of Computational Equivalence
 Artificial intelligence
 Robert Rosen
External links and references
 Weisstein, Eric W., et al., "Computational irreducibility". MathWorld—A Wolfram Web Resource.
 Wolfram, Stephen, "A New Kind of Science". Wolfram Media, Inc., May 14, 2002. ISBN 1579550088
 Wolfram, Stephen, "Computational irreducibility". A New Kind of Science.
 Wolfram, Stephen, "History of computational irreducibility". A New Kind of Science.
 Wolfram, Stephen, "History of computational irreducibility notes". A New Kind of Science.
 Wolfram, Stephen, "Undecidability and intractability in theoretical physics". Physical Review Letters, 1985.
 Israeli, Navot, and Nigel Goldenfeld, "On computational irreducibility and the predictability of complex physical systems". Physical Review Letters, 2004.
 "Computational irreducibility". ISAAC/EINSTein research and development.
 Berger, David, "Stephen Wolfram, A New Kind of Science". Serendip's Bookshelves.
 "Complexity is Elusive". Physical Review Letter, March 4, 2004.
 Tomasson, Gunnar, "Scientific Theory and Computational Irreducibility". A New Kind of Science: The NKS Forum.
Categories:
Wikimedia Foundation. 2010.
Look at other dictionaries:
Computational — may refer to: Computer Computational algebra Computational Aeroacoustics Computational and Information Systems Laboratory Computational and Systems Neuroscience Computational archaeology Computational auditory scene analysis Computational biology … Wikipedia
A New Kind of Science — Author(s) Stephen Wolfram Country … Wikipedia
Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states … Wikipedia
Mathematical economics — Economics … Wikipedia
John von Neumann — Von Neumann redirects here. For other uses, see Von Neumann (disambiguation). The native form of this personal name is Neumann János. This article uses the Western name order. John von Neumann … Wikipedia
List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… … Wikipedia
Sociology — For the journal, see Sociology (journal). Sociology … Wikipedia
List of theorems — This is a list of theorems, by Wikipedia page. See also *list of fundamental theorems *list of lemmas *list of conjectures *list of inequalities *list of mathematical proofs *list of misnamed theorems *Existence theorem *Classification of finite… … Wikipedia
Maurice MerleauPonty — Full name Maurice Merleau Ponty Born 14 March 1908 Died 4 May 1961 Era 20th century philosophy … Wikipedia
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia