Newsgroups: comp.ai.neural-nets
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!udel!darwin.sura.net!news.Vanderbilt.Edu!NewsWatcher!user
From: goldenjb@ctrvax.vanderbilt.edu (jim golden)
Subject: Re: Complexity analysis of NNs
Message-ID: <goldenjb-271094121240@129.59.170.62>
Followup-To: comp.ai.neural-nets
Sender: news@news.vanderbilt.edu
Nntp-Posting-Host: 129.59.170.62
Organization: vanderbilt
References: <1994Oct27.115825.8801@dcs.warwick.ac.uk>
Date: Thu, 27 Oct 1994 16:53:02 GMT
Lines: 18

In article <1994Oct27.115825.8801@dcs.warwick.ac.uk>,
Martyn.Amos@dcs.warwick.ac.uk (Martyn Amos) wrote:

> Greetings.
> 
> I didn't see this mentioned in the FAQ, so....
> I'm interested in complexity analysis of neural nets (eg. predicting average time
> taken to train a net to find an optimal solution). 
> 
> If anyone has any references or pointers I'd be very grateful.
> 
Some of the best research available comes from SanteFe.  Check out older
issues of Physica D for some really interesting discussions of complexity
(maybe more detailed then your definition above) and NN.  Stephanie
Forest's book _Emergent Computation_ is a really neat source of ideas.

Jim Golden
goldenjb@ctrvax.vanderbilt.edu
