Computational irreducibility
From CasGroup
for
Computational irreducibility
Jump to:
navigation
,
search
'''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 [http://en.wikipedia.org/wiki/Computational_irreducibility Computational irreducibility] * MathWorld entry for [http://mathworld.wolfram.com/ComputationalIrreducibility.html Computational irreducibility]
Return to
Computational irreducibility
.
Views
Page
Discussion
View source
History
Personal tools
Log in
Navigation
Main page
Community portal
Current events
Recent changes
Random page
Help
Search
Toolbox
What links here
Related changes
Special pages