Editing Computational irreducibility (section)

{{Short description|Concept proposed by Stephen Wolfram}}
{{Multiple issues|
{{Primary sources|date=April 2020}}
{{Original research|date=April 2020}}
{{More citations needed|date=May 2019}}
}}

'''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 [[Stephen Wolfram]] in his 2002 book ''[[A New Kind of Science]]'', although the concept goes back to studies from the 1980s.<ref>{{Cite web |date=2022-06-06 |title=Multicomputational Irreducibility—Wolfram Physics Bulletins |url=https://bulletins.wolframphysics.org/2022/06/multicomputational-irreducibility/ |access-date=2025-03-23 |website=bulletins.wolframphysics.org |language=en}}</ref>