Neural nets : classical results and current problems Public Deposited

http://ir.library.oregonstate.edu/concern/technical_reports/1z40kv196

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • This note briefly discusses some of the classical results of McCulloch and Pitts. It then deals with some current research in neural nets. Several questions about neural nets are shown to be computationally difficult by showing that they are NP-Complete or worse. The size of neural nets necessary to compute functions or simulate machines is discussed, and some worst case optimal results are given. The statistics of randomly chosen autonomous nets are discussed, together with some approaches to understanding these statistics. Recent results on the behavior of analog nets are discussed, and the possibility of silicon implementation is mentioned.
Resource Type
Date Available
Date Issued
Series
Subject
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2012-04-18T17:23:22Z (GMT). No. of bitstreams: 1 Neural nets classical results and current problems.pdf: 112068 bytes, checksum: 6231399572439594ad9b752546e97344 (MD5) Previous issue date: 1995-04
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-04-18T17:23:22Z (GMT) No. of bitstreams: 1 Neural nets classical results and current problems.pdf: 112068 bytes, checksum: 6231399572439594ad9b752546e97344 (MD5)
  • description.provenance : Submitted by Laura Wilson (laura.wilson@oregonstate.edu) on 2012-04-18T17:21:30Z No. of bitstreams: 1 Neural nets classical results and current problems.pdf: 112068 bytes, checksum: 6231399572439594ad9b752546e97344 (MD5)

Relationships

In Administrative Set:
Last modified: 07/18/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items