On connectionist models

DOI10.1002/CPA.3160410804MaRDI QIDQ3791091zbMATH OpenOpenAlexWikidataFDO

Authors Jia-Wei Hong

Publication date 1988

Published in Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cpa.3160410804

zbMATH Keywords

Boolean gatesconnectionist modelsneuronsparallel hardware models

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• On the computational power of neural nets
• Connectionistic models of Boolean category representation
• Neural network models
• Turing computability with neural nets
• Neural networks and Boolean functions

Cited in

(16)

• Connectionistic models of Boolean category representation
• Connectionist networks qua graphs
• A unified framework for connectionist systems
• Introduction to connectionist computing
• The relationship between connectionist models and a dynamic data-oriented theory of concept formation
• Analog computation via neural networks
• Abstraction based connectionist analogy processor
• scientific article; zbMATH DE number 4162238 (Why is no real title available?)
• scientific article; zbMATH DE number 4072428 (Why is no real title available?)
• scientific article; zbMATH DE number 1261153 (Why is no real title available?)
• The connections of large perceptrons
• On Activation, Connection, and Behavior in Dynamic Architectures
• Neural networks and complexity theory
• Computing Boolean statistical models.
• Connectionist functionality and the emergent network behavior
• Learning from hints in neural networks

This page was built for publication: On connectionist models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3791091)