Universal Boolean Logic in Cascading Networks

TL;DR

This paper demonstrates that networks with antagonistic interactions can perform universal Boolean logic, linking computation theory with percolation, and explores their properties and potential for classification tasks.

Contribution

It introduces a model of cascading networks capable of universal Boolean logic, unifying computation and percolation theories.

Findings

Universal Boolean logic circuits can be implemented in antagonistic cascade networks.

The model exhibits determinism and specific cascade frequencies.

The approach enables classification within the cascade framework.

Abstract

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.