Universal Boolean Computation in Negatively Coupled Circle Map Lattices
Priyanka D. Bhoyar, Prashant M. Gade
Abstract
We investigate the computational capabilities of a one-dimensional lattice of negatively coupled circle maps in its traveling wave regime. We interpret propagating waves as information carriers and exploit their interactions to implement Boolean logic. The logical states are encoded by the propagation direction of the traveling waves, while the presence or absence of a wave at a designated output location represents the logical output. Using controlled wave collisions, we demonstrate the realization of NAND and NOR gates along with other basic gates. Since NAND and NOR operations are functionally complete, the results establish that the traveling wave regime of the negatively coupled circle-map lattice supports universal Boolean computation in principle. The demonstrated logical operations remain valid over a finite range of the coupling strength εand map parameter ω, indicating robustness of the computational scheme to parameter variations. Our results therefore demonstrate that computational functionality can emerge from the collective nonlinear dynamics of a coupled map lattice, providing a con- nection between the dynamical properties of traveling wave states and collision based information processing.
Create a lesson
Related papers
Developing the Statistical Mechanics of Evolving Assembly Spaces
Anisha K. Yeddanapudi, Abhishek Sharma, Ian Seet et al.
Ergodicity breaking transition beyond qubits
Tanay Pathak, Abhik Kumar Saha
Extended-range percolation on lattices with cubic and non-compact neighborhoods in three dimensions
Zhe Zhang, Yuxuan Fan, Yang Yang et al.
Competitive scaling of small-subsystem-optimization heuristics for LABS
Ginger E. Lau, Adil A. Gangat
IceCube data for astrophysical neutrinos exhibit q-statistical behavior
Constantino Tsallis, Ugur Tirnakli
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov