Connectionists: Stephen Hanson in conversation with Geoff Hinton
Barak A. Pearlmutter
barak at pearlmutter.net
Mon Jul 18 12:19:09 EDT 2022
On Mon, 18 Jul 2022 at 17:02, Gary Marcus <gary.marcus at nyu.edu> wrote:
>
> sure, but a person can learn [n-bit parity] from a few examples with a small number of bits, generalizing it to large values of n. most current systems learn it for a certain number of bits and don’t generalize beyond that number of bits.
Really? Because I would not think that induction of a two-state DFA
over a two-symbol alphabet woud be beyond the current state of the
art.
--Barak Pearlmutter.
More information about the Connectionists
mailing list