Lipscomb J. (1987). On the computational complexity of finding a connectionist models stable state vectors Unpublished masters thesis, Department of Computer Science, University of Toronto.

See more from authors: Lipscomb J

References and models cited by this paper
References and models that cite this paper

Síma J, Orponen P. (2003). General-purpose computation with neural networks: a survey of complexity theoretic results. Neural computation. 15 [PubMed]

This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.