Bounds for the Computational Power and Learning Complexity of Analog Neural Nets

DOI10.1137/S0097539793256041zbMath0870.68061OpenAlexW2066915075MaRDI QIDQ4337641

Wolfgang Maass

Publication date: 26 May 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539793256041

zbMATH Keywords

neural networkscircuit complexitythreshold circuitslearning complexityanalog computing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20) Analytic circuit theory (94C05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Unnamed Item, Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity, Piecewise-Linear Neural Networks and Their Relationship to Rule Extraction from Data