# Universal Boolean Logic in Cascading Networks

arXiv: https://arxiv.org/abs/1910.10472 · HTML: https://mlsanity.com/paper/1910.10472/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Oct 2019.

## Built on by (most cited first, 1 of 1)

- [Spontaneous Emergence of Computation in Network Cascades](https://mlsanity.com/paper/2204.11956/) (2022)

## Abstract (arXiv)

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.