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.

computational irreducibility | multicomputation | multicomputational paradigm