Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Computational irreducibility
open-in-new
<p>Computational irreducibility suggests certain computational processes cannot be simplified such that the only way to determine the outcome of such a process is to go through each step of its computation. It is one of the main ideas proposed by <a href="/facts/Stephen_Wolfram/pJTChkGB">Stephen Wolfram</a> in his 2002 book <i><a href="/facts/A_New_Kind_of_Science/kqsM7RBp">A New Kind of Science</a></i>, although the concept goes back to studies from the 1980s. </p>