Universal Boolean Logic in Cascading Networks
Social and Information Networks
2019-10-24 v1 Biological Physics
Data Analysis, Statistics and Probability
Physics and Society
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.
Cite
@article{arxiv.1910.10472,
title = {Universal Boolean Logic in Cascading Networks},
author = {Galen Wilkerson and Sotiris Moschoyiannis},
journal= {arXiv preprint arXiv:1910.10472},
year = {2019}
}
Comments
12 pages, 8 figures