https://wiki.cas-group.net/index.php?action=history&feed=atom&title=Computational_irreducibility 2026-07-19T17:38:14Z Revision history for this page on the wiki MediaWiki 1.43.8 https://wiki.cas-group.net/index.php?title=Computational_irreducibility&diff=1612&oldid=prev 2011-03-31T21:48:36Z

<p></p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 16:48, 31 March 2011</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1">Line 1:</td> <td colspan="2" class="diff-lineno">Line 1:</td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>'''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.  </div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>'''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<ins style="font-weight: bold; text-decoration: none;">. An irreducible computation is a bit like a story that resists summarization at any level of detail</ins>.</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== Links ==</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== Links ==</div></td></tr> </table>

Jfromm https://wiki.cas-group.net/index.php?title=Computational_irreducibility&diff=1482&oldid=prev 2011-03-01T20:35:32Z

<p>Created page with &quot;&#039;&#039;&#039;Computational irreducibility&#039;&#039;&#039; 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...&quot;</p> <p><b>New page</b></p><div>&#039;&#039;&#039;Computational irreducibility&#039;&#039;&#039; 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. <br /> <br /> == Links ==<br /> <br /> * Wikipedia entry for [http://en.wikipedia.org/wiki/Computational_irreducibility Computational irreducibility]<br /> * MathWorld entry for [http://mathworld.wolfram.com/ComputationalIrreducibility.html Computational irreducibility]</div>

Jfromm