Stochastic analog networks and computational complexity

DOI10.1006/jcom.1999.0505zbMath0949.68069OpenAlexW2047164342MaRDI QIDQ1578510

Hava T. Siegelmann

Publication date: 3 September 2000

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1999.0505

zbMATH Keywords

automatic learninganalog recurrent neural networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Turing computability with neural nets
• On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
• Analog computation via neural networks
• On the computational power of neural nets
• Robustness of probabilistic computational complexity classes under definitional perturbations
• Reliable computation by formulas in the presence of noise
• Invariance of complexity measures for networks with unreliable gates
• Computational power of neural networks: a characterization in terms of Kolmogorov complexity
• Quantum complexity theory