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).
Multicomputational Irreducibility
See also
Computational Irreducibility, Multicomputation, Multicomputational ParadigmExplore with Wolfram|Alpha
References
Boyd, J. "Multicomputational Irreducibility." Jun. 6, 2022. https://www.wolframphysics.org/bulletins/2022/06/multicomputational-irreducibility/.Cite this as:
Weisstein, Eric W. "Multicomputational Irreducibility." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MulticomputationalIrreducibility.html