Universal computation using localized limit-cycle attractors in neural networks
Neural networks are dynamical systems that compute with their dynamics. One example is the Hopfield model, forming an associative memory which stores patterns as global attractors of the network dynamics. From studies of dynamical networks it is well known that localized attractors also exist. Yet, they have not been used in computing paradigms. Here we show that interacting localized attractors in threshold networks can result in universal computation. We develop a rewiring algorithm that builds universal Boolean gates in a biologically inspired two-dimensional threshold network with randomly placed and connected nodes using collision-based computing. We aim at demonstrating the computational capabilities and the ability to control local limit cycle attractors in such networks by creating simple Boolean gates by means of these local activations. The gates use glider guns, i.e., localized activity that periodically generates "gliders" of activity that propagate through space. Several such gliders are made to collide, and the result of their interaction is used as the output of a Boolean gate. We show that these gates can be used to build a universal computer.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Cyclic Denoising Reveals Ultrastable Memories in Diffusion Models
We introduce cyclic denoising -- repeated forward and reverse diffusion at controlled noise amplitudes -- as an extraction attack for image diffusion models. Inspired by random organization in disordered solids, cyclic d…
A Differential Manifold Perspective and Universality Analysis of Continuous Attractors in Artificial Neural Networks
Continuous attractors are critical for information processing in both biological and artificial neural systems, with implications for spatial navigation, memory, and deep learning optimization. However, existing research…
Thermodynamic limit in learning period three
A continuous one-dimensional map with period three includes all periods. This raises the following question: Can we obtain any types of periodic orbits solely by learning three data points? In this paper, we report the a…
DiversityCore motifs predict dynamic attractors in combinatorial threshold-linear networks
Combinatorial threshold-linear networks (CTLNs) are a special class of inhibition-dominated TLNs defined from directed graphs. Like more general TLNs, they display a wide variety of nonlinear dynamics including multistab…
Hidden Order of Boolean Networks
It is a common belief that the order of a Boolean network is mainly determined by its attractors, including fixed points and cycles. Using semi-tensor product (STP) of matrices and the algebraic state-space representatio…