Chaotic neural nets, computability, and undecidability: Toward a computational dynamics

DOI10.1002/INT.4550100106zbMath0866.58027OpenAlexW2022818419WikidataQ126242572 ScholiaQ126242572MaRDI QIDQ4851891

Gianfranco Basti, Antonio L. Perrone

Publication date: 17 October 1995

Published in: International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/int.4550100106

zbMATH Keywords

algorithmssymbolic dynamicscomputational efficiencyrecursive functionschaotic neural netscomplex chaotic dynamicsRössler chaotic attractor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Complexity and performance of numerical algorithms (65Y20) Low-dimensional dynamical systems (37E99) Theory of computing (68Q99)

Cites Work

• Unnamed Item
• Discrete-time versus continuous-time models of neural networks
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I

This page was built for publication: Chaotic neural nets, computability, and undecidability: Toward a computational dynamics