Neural networks as systems for recognizing patterns

DOI10.1007/BF02355444zbMath0902.68171OpenAlexW2011328224MaRDI QIDQ1270539

Yu. G. Smetanin

Publication date: 22 October 1998

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02355444

zbMATH Keywords

perceptronHopfield neural networkcomplexity of learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-organization and associative memory
• On the power of neural networks for solving hard problems
• Using conditional moments of asset payoffs to infer the volatility of intertemporal marginal rates of substitution
• On the computational efficiency of symmetric neural networks
• Finding approximate solutions to NP-hard problems by neural networks is hard
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• A theory of the learnable
• The capacity of the Hopfield associative memory
• The convergence of symmetric threshold automata
• Random interactions in higher order neural networks
• Efficient simulation of finite automata by neural nets
• Neural networks and physical systems with emergent collective computational abilities.
• On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems
• The space of interactions in neural network models
• Enumeration of Seven-Argument Threshold Functions
• Partitions ofN-Space by Hyperplanes