continuous vs symbolic: a more concrete problem

GOLDFARB%unb.ca@UNBMVS1.csd.unb.ca GOLDFARB%unb.ca at UNBMVS1.csd.unb.ca
Wed Jan 9 18:53:57 EST 1991


Let me state the problem again:

     Given a nontrivial infinite family of languages, how does one go
     about constructing a reasonably efficient NN that can learn to
     recognize any language from this family?

-- Lev Goldfarb



More information about the Connectionists mailing list