| Computational Irreducibility |
Article Index for Computational |
Website Links For Computational |
Information AboutComputational Irreducibility |
| CATEGORIES ABOUT COMPUTATIONAL IRREDUCIBILITY | |
| information theory | |
| computer science | |
|
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 actually 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
ANALYSIS Israeli and Goldenfeld found that some less complex systems behaved simply and predictably (thus, they allowed Approximation s). However, more complex systems were still computationally irreducible and unpredictable. It is unknown what conditions would allow complex phenomenon to be described simply and predictably. SEE ALSO
EXTERNAL LINKS AND REFERENCES
|
|
|