Connectionists: Stephen Hanson in conversation with Geoff Hinton

[Gary Marcus]

sure, but this goes back to Tom’s point about representation; i addressed this sort of thing at length in Chapter 3 of The Algebraic Mind. 

You can solve this one problem in that way but then give up most of the other virtues of Transformers etc if you build a different network and representational scheme for each problem you encounter.

> On Jul 18, 2022, at 9:19 AM, Barak A. Pearlmutter <barak at pearlmutter.net> wrote:
> 
> 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.