The Computational Power of Discrete Hopfield Nets with Hidden Units | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

The Computational Power of Discrete Hopfield Nets with Hidden Units

Neural Computation (1996) 8 (2): 403–415.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation

Makito Oku
Kazuyuki Aihara

Physics Letters A (2010) 374 (48): 4859.

Computation in gene networks

Asa Ben-Hur
Hava T. Siegelmann

Chaos: An Interdisciplinary Journal of Nonlinear Science (2004) 14 (1): 145.

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results

Jiří Šíma
Pekka Orponen

Neural Computation (2003) 15 (12): 2727.

Continuous-Time Symmetric Hopfield Nets Are Computationally Universal

Jiří Šíma
Pekka Orponen

Neural Computation (2003) 15 (3): 693.

On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets

Jiří Šíma
Pekka Orponen
Teemu Antti-Poika

Neural Computation (2000) 12 (12): 2965.

Computational power of neural networks: a characterization in terms of Kolmogorov complexity

J.L. Balcazar
R. Gavalda
H.T. Siegelmann

IEEE Transactions on Information Theory (1997) 43 (4): 1175.

Computing with truly asynchronous threshold logic networks

Pekka Orponen

Theoretical Computer Science (1997) 174 (1-2): 123.