Cellular automata and discrete neural networks

DOI10.1016/0167-2789(90)90200-9zbMath0729.68055OpenAlexW2092324494MaRDI QIDQ807039

Max H. Garzon

Publication date: 1990

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-2789(90)90200-9

zbMATH Keywords

dynamical systemsneural networkscellular automatacellular automatonTuring computabilityNP-hard problemsComputable self-mapscoNP-complete problemsdynamics digraphs

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Nonlinear digital filters mimicking cellular neural networks

Cites Work

• Parallel computation with threshold functions
• Cellular automata and statistical mechanical models
• Theory of majority decision elements
• Tesselations with local transformations
• `` Strong NP-Completeness Results
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Neural networks and physical systems with emergent collective computational abilities.
• Endomorphisms and automorphisms of the shift dynamical system
• A logical calculus of the ideas immanent in nervous activity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cellular automata and discrete neural networks