Newsgroups: comp.ai.neural-nets
Path: cantaloupe.srv.cs.cmu.edu!rochester!cornellcs!travelers.mail.cornell.edu!news.kei.com!news.mathworks.com!newsfeed.internetmci.com!news.msfc.nasa.gov!elroy.jpl.nasa.gov!lll-winken.llnl.gov!venus.sun.com!wnoc-sfc-news!sfc-keio-news!nabe
From: nabe@mag.keio.ac.jp (Hiroaki Watanabe)
Subject: Learnability on Neural Nets
Message-ID: <1995Sep15.182339.21826@sfc.keio.ac.jp>
Sender: news@sfc.keio.ac.jp
Nntp-Posting-Host: ss15.mag.keio.ac.jp
Organization: Keio University Media & Governance
X-Newsreader: mnews [version 1.18] 1994-05/16(Mon)
Date: Fri, 15 Sep 1995 18:23:39 GMT
Lines: 11

Hi,

I am interested in topics on the theory of average case complexity.

I would like to know if there are papers on PAC (Probably Approximately
Correct)learning on Neural Nets, especially on recurrent neural nets.

Thank you.

Regards,
Hiroaki Watanabe
