Definition
Computational irreducibility suggests certain computational processes cannot be simplified and the only way to determine the outcome of 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.
Related concepts
A New Kind of ScienceApproximationArtificial intelligenceBehaviorChaos theoryCompatibilismComplexityComputationComputational sourcehoodEmergent behaviourGödel's incompleteness theoremInitial conditionsKolmogorov ComplexityMarius KrummMarkus P Muller (physicist)Nigel GoldenfeldPhenomenaPhysical Review LettersPrinciple of Computational EquivalenceRobert Rosen (theoretical biologist)Stephen WolframSystem
3 concepts already in your glossary