Task‐performing dynamics in irregular, biomimetic networks

, &
Complexity 12 (6):14-21 (2007)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/cplx.20181

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Guidelines for dynamics‐based parameterization of one‐dimensional cellular automata rule spaces.Gina Maira Barbosa de Oliveira, Pedro P. B. de Oliveira & Nizam Omar - 2000 - Complexity 6 (2):63-71.
Control parameters in Boolean networks and cellular automata revisited from a logical and a sociological point of view.Jürgen Klüver & Jörn Schmidt - 1999 - Complexity 5 (1):45-52.
Dynamics of networks evolved for cellular automata computation.Anca Gog & Camelia Chira - 2012 - In Emilio Corchado, Vaclav Snasel, Ajith Abraham, Michał Woźniak, Manuel Grana & Sung-Bae Cho (eds.), Hybrid Artificial Intelligent Systems. Springer. pp. 359--368.
The global dynamics of cellular automata, by Andrew Wuensche and Mike Lesser.Stuart Kauffman - 2000 - Complexity 5 (6):47-48.
Evolution and dynamics of node-weighted networks for cellular automata computation.A. Andreica & C. Chira - 2015 - Logic Journal of the IGPL 23 (3):400-409.
Is prediction possible? Chaotic behavior of Multiple Equilibria Regulation Model in cellular automata topology.Ioannis D. Katerelos & Andreas G. Koulouris - 2004 - Complexity 10 (1):23-36.
Planigon tessellation cellular automata.Alexander Korobov - 1999 - Complexity 4 (6):31-38.
Classifying cellular automata automatically: Finding gliders, filtering, and relating space-time patterns, attractor basins, and theZ parameter.Andrew Wuensche - 1999 - Complexity 4 (3):47-66.
How to make dull cellular automata complex by adding memory: Rule 126 case study.Genaro J. Martínez, Andrew Adamatzky, Juan C. Seck‐Tuoh‐Mora & Ramon Alonso‐Sanz - 2010 - Complexity 15 (6):34-49.
A cellular automata model can quickly approximate UDP and TCP network traffic.Richard R. Brooks, Christopher Griffin & T. Alan Payne - 2004 - Complexity 9 (3):32-40.

Analytics

Added to PP
2013-11-21

Downloads
45 (#344,810)

6 months
2 (#1,448,741)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Dynamical embodiments of computation in cognitive processes.James P. Crutchfield - 1998 - Behavioral and Brain Sciences 21 (5):635-635.

Add more references