Excitable Media as Computational Systems

  • A. V. Holden
  • J. V. Tucker
  • B. C. Thompson
Part of the NATO ASI Series book series (NSSB, volume 244)


A number of mathematical approaches may be used to model a given excitable system. For an excitable system that is not spatially extensive a map, or a system of nonlinear ordinary differential equations may be appropriate. For a spatially extensive excitable medium a system of partial differential equations, or a coupled map lattice, or a cellular automaton, might be an appropriate model. These different types of model are all nonlinear, and are often intractable, and so their behaviour is usually investigated by numerical methods on a digital computer, using some appropriate algorithms.


Cellular Automaton Cellular Automaton Excitable Medium Discrete Space Nonlinear Ordinary Differential Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Kuhnert, L. (1986) A new photochemical memory device in a light sensitive active medium. Nature 319 393ADSCrossRefGoogle Scholar
  2. [2]
    Kirby, K.G. and Conrad, M. (1996) Intraneuronal dynamics as a substrate for evolutionary learning. Physica-D 22 205–215.ADSCrossRefMathSciNetGoogle Scholar
  3. [3]
    Thompson, B.C. (1987) A mathematical theory of synchronous concurrent algorithms. PhD thesis, School of Computing Studies, University of Leeds.Google Scholar
  4. [4]
    Zykov, V.S. (1987) Simulation of wave processes in excitable media. Manchester University Press.zbMATHGoogle Scholar
  5. [5]
    Fogelman-Soulié, F., Robert, Y. and Tchuente, M., eds. (1987) Automata networks in computer science. Manchester University Press.Google Scholar
  6. [6]
    Crutchfield, J.P. and Kaneko, K. (1988) Phenomenology of spatio-temporal chaos, in Directions in chaos, Hao Bai-Lin (ed.) World ScientifiC., Singapore.Google Scholar
  7. [7]
    Neumann, J. von (1966) in Theory of self reproducing automata. A.W. Burks, ed. University of Illinois Press, Urbana.Google Scholar
  8. [8]
    Farmer, D., Tofoli, T and Wolfram, S., eds. (1984) Cellular automata. Physica-D 10 1–248Google Scholar
  9. [9]
    Tchuente, M (1987) Computation in automata networks, in [5].Google Scholar
  10. [10]
    Dewdney, A.K. (1989) Computer recreations. Scientific American 88–91Google Scholar
  11. [11]
    Kaneko, K. (1989). Pattern dynamics in spatio-temporal chaos. Physica-D 34 1–41.ADSCrossRefzbMATHMathSciNetGoogle Scholar
  12. [12]
    Labos, E. (1987) Spike generating dynamical systems and networks. In Dynamical systems: proceedings of IIASA workshop on mathematics of dynamical processes. A.B. Kurzhanski and K. Sigmund (eds) Lecture Notes in Economics and Mathematical Systems. Springer-Verlag: Berlin.Google Scholar
  13. [13]
    Thompson, B.C. and Tucker, J.V. (1990) Synchronous concurrent algorithms, Computer Science Division, University College of Swansea Research Report (in preparation) Google Scholar
  14. [14]
    Holden, A.V., Tucker, J.V. and Thompson, B.C. (1990) the computational structure of neural systems. In: Neurocomputers and attention: I: Neurobiology, synchronisation and chaos, ed. A.V. Holden and V.I Kryukov. Manchester University Press.Google Scholar

Copyright information

© Springer Science+Business Media New York 1991

Authors and Affiliations

  • A. V. Holden
    • 1
  • J. V. Tucker
  • B. C. Thompson
    • 2
  1. 1.Centre for Nonlinear StudiesUniversity of LeedsUK
  2. 2.Department of Mathematics and Computer ScienceUniversity CollegeSwanseaWales UK

Personalised recommendations