2010.03585
arxiv.org · 7,230 words · saved by 1 readers
N/A
1 Cellular Automata Can Reduce Memory Requirements of Collective-State Computing Denis Kleyko, E. Paxon Frady, and Friedrich T. Sommer Abstract—Various non-classical approaches of distributed in- include reservoir computing (RC) [2], [3], [4], [5] for buffering formation processing, such as neural networks,…
saved by
related reading
- 2409.02908arxiv.org
- [2111.00396] Efficiently Modeling Long Sequences with Structured State Spacesarxiv.org
- [2608.27540] Towards a mathematical theory of superpositionarxiv.org
- [2510.26745] Deep sequence models tend to memorize geometrically; it is unclear whyarxiv.org
- Statistical Mechanics of Deep Learningganguli-gang.stanford.edu
- [2111.00396] Efficiently Modeling Long Sequences with Structured State Spacesarxiv.org
- arxiv.org/pdf/1805.08522arxiv.org
- https://arxiv.org/pdf/2006.11239arxiv.org
- [2605.01192] Linear-Readout Floors and Threshold Recovery in Computation in Superpositionarxiv.org
- 2310.01405.pdfarxiv.org
- 2310.01405arxiv.org
- [2410.12101] The Persian Rug: solving toy models of superposition using large-scale symmetriesarxiv.org