Reservoir Computing with Cellular Automata (ReCA) is a promising concept by virtue of its potential for efficient hardware implementation and theoretical understanding of Cellular Auotmata (CA). However, ReCA has so far only been studied in exploratory studies. In this work, we take a more in depth view of the landscape of Elementary Cellular Automata for Reservoir Computing. In this paper, the ReCA is applied to the X-bit memory benchmark with a thorough exploration for key parameters including number of random mappings (R), number of bits (Nb) and size of the vector that the random mapping is mapped to (Ld). Our evidence shows that the parameter space, including the full panoply of CA rules, is much richer then what previous evidence indicates. This suggests that some CA rules would require careful consideration and custom parameters setup.

Issue Section:
General Conference
Reservoir Computing, Cellular Automata, Reservoir Computing with Cellular Automata (ReCA), Edge of Chaos
This content is only available as a PDF.
© 2021 Massachusetts Institute of Technology Published under a Creative Commons Attribution 4.0 International (CC BY 4.0) license
2021
Massachusetts Institute of Technology
This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. For a full description of the license, please visit https://creativecommons.org/licenses/by/4.0/legalcode.
Issue Section:
General Conference