Unsolvability, complexity, and neural networks
β Scribed by E.V. Krishnamurthy
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 197 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0893-6080
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract This paper proposes complex neural networks in the form of a perceptron and an autocorrelation associatron. Their properties are described and the results of computer simulation are presented. The discriminant power of the complex perceptron is nearly twice that of the real perceptron b
Th& paper aims to p&ce neural networks in the conte.\t ol'booh'an citz'ldt complexit.l: 1,1~, de/itte aplm~priate classes qlfeedybrward neural networks with specified fan-in, accm'ac)' olcomputation and depth and ttsing techniques" o./commzmication comph:Β₯ity proceed to show t/tat the classes.fit in
We formalize a notion of loading information into connectionist networks that characterizes the training of feed-forward neural networks. This problem is NPcomplete, so we look for tractable subcases of the problem by placing constraints on the network architecture. The focus of these constraints is
Neural networks are capable of simultaneously analyzing multiple loci at one time in order to identify patterns of loci involved in complex traits.