  Computational properties of networks that can undergo cascades are examined.
It is shown that universal Boolean logic circuits can be computed by a global
cascade having antagonistic interactions. Determinism and cascade frequency of
this antagonistic model are explored,as well as its ability to perform
classification. Universality of cascade logic may have far-reaching
consequences, in that it can allow unification of the theory of computation
with the theory of percolation.
