Discrete computation using a perturbed heteroclinic network
Ashwin, Peter; Borresen, Jon
Date: 15 August 2005
Journal
Physics Letters A
Publisher
Elsevier
Publisher DOI
Abstract
Transient synchronization into clusters appears in many biological and physical
systems and seems to be important for computation within neural systems. In this
paper we show how one can robustly and effectively perform practical computations
using small perturbations to a very simple globally coupled network of oscillators.
Computations ...
Transient synchronization into clusters appears in many biological and physical
systems and seems to be important for computation within neural systems. In this
paper we show how one can robustly and effectively perform practical computations
using small perturbations to a very simple globally coupled network of oscillators.
Computations are performed by exploiting the spatio-temporal dynamics of a robust
attracting heteroclinic network (also referred to as `winnerless competition' dynamics)
to describe the states and transitions between them. We use different cluster
synchronization states to encode states and use this to design a simple multi-base
counter. The simulations indicate that this gives a robust computational system
exploiting the natural dynamics of the system.
Mathematics and Statistics
Faculty of Environment, Science and Economy
Item views 0
Full item downloads 0