Computational irreducibility: Difference between revisions
From CasGroup
Jump to navigationJump to search
Created page with "'''Computational irreducibility''' is one of the main ideas proposed by Stephen Wolfram in his book A New Kind of Science. Computations that cannot be sped up by means of any sho..." |
No edit summary |
||
| Line 1: | Line 1: | ||
'''Computational irreducibility''' is one of the main ideas proposed by Stephen Wolfram in his book A New Kind of Science. Computations that cannot be sped up by means of any shortcut are called computationally irreducible. Stephen Wolfram proposed the principle of computational irreducibility, which says that the only way to determine the answer to a computationally irreducible question is to perform, or simulate, the computation. | '''Computational irreducibility''' is one of the main ideas proposed by Stephen Wolfram in his book A New Kind of Science. Computations that cannot be sped up by means of any shortcut are called computationally irreducible. Stephen Wolfram proposed the principle of computational irreducibility, which says that the only way to determine the answer to a computationally irreducible question is to perform, or simulate, the computation. An irreducible computation is a bit like a story that resists summarization at any level of detail. | ||
== Links == | == Links == | ||
Latest revision as of 16:48, 31 March 2011
Computational irreducibility is one of the main ideas proposed by Stephen Wolfram in his book A New Kind of Science. Computations that cannot be sped up by means of any shortcut are called computationally irreducible. Stephen Wolfram proposed the principle of computational irreducibility, which says that the only way to determine the answer to a computationally irreducible question is to perform, or simulate, the computation. An irreducible computation is a bit like a story that resists summarization at any level of detail.
Links
- Wikipedia entry for Computational irreducibility
- MathWorld entry for Computational irreducibility
