Multicomputational Irreducibility

Depending on the convergence and divergence of their parallel evaluation fronts, multicomputations appear to be either predictable or unpredictable. The property of unpredictability for multicomputations opens upon a trove of new questions about the behavioral study of computational rules and may be referred to as multicomputational irreducibility (Boyd 2022).

See also

Computational Irreducibility, Multicomputation, Multicomputational Paradigm

Explore with Wolfram|Alpha


Boyd, J. "Multicomputational Irreducibility." Jun. 6, 2022.

Cite this as:

Weisstein, Eric W. "Multicomputational Irreducibility." From MathWorld--A Wolfram Web Resource.