Remarks on the frequency-coded neural nets complexity
Some of the basic models of the neural nets are presented. Short introduction to the neural net computation and complexity theory is given and the frequency-coded neural net are explored. It is shown that it has the same computational power as the Hopfield net and belongs to second machine class.
Unable to display preview. Download preview PDF.
- (2).Barahona, F.: On the Computational Complexity of Ising Spin Glass Models. J. Phys. A. 15, 1982, pp. 3241–3253Google Scholar
- (3).Browning, I.: A Self-Organizing System Called ”Mickey Mouse”. Panomaric Research,Inc., Palo Alto, Calif.Google Scholar
- (4).Dress, W. B.: Frequency-Coded Artificial Neural Networks: An Approach To Self-Organizing Systems. Proc. IEEE 1st Ann. Int. Conf. on Neural Net., USA, 1987Google Scholar
- (5).Dress, W. B.: Darwinian Optimization Of Synthetic Neural Systems. Proc. IEEE 1st Ann. Int. Conf. on Neural Net., USA, June 1987Google Scholar
- (6).Hopfield, J. J.: Neurons with Graded Response Have Collective Computational Properties Like Those of Two-state Neurons. Proc. Natl. Acad. Sci. USA, 1984, pp. 3088–3092Google Scholar
- (7).Parberry, I.: A Primer on the Complexity Theory of Neural Networks. Research Report CS-88-38, Dept. of Comp. Sci., The Pennsylvania state university, October 1988Google Scholar
- (8).Parberry, I. — Schnitger, G.: Relating Boltzmann Machines to Conventional models of Computations. Neural Networks, 2, 1989Google Scholar
- (9).Wiedermann, J.: On the Computational Efficiency of Symmetric Neural Networks. Proc. 14-th Symp. on Math. Found. of Comp. Sci., MFCS'89, LNCS Vol. 379, Springer Verlag, Berlin, 1989, pp. 545–552Google Scholar