Print

Print


--- Steg Belsky <[log in to unmask]> wrote:
> On Wednesday, December 31, 2003, at 06:59  PM, Gary
> Shannon wrote:
> > In Chomp, the language of intelligent machines:
> > Assert
> > (
> >    country< S, MOD:Of( pronoun( 1S ))>.Resemble
> >    (
> >       flower<SA>,
> >       PRESENT
> >    ),
> >    CAUSE:pronoun(country<S>).Born
> >    (
> >       MOD:
> >       [
> >          TEMP:morning<S,each>,
> >          LOC:Between( sky, sea )
> >       ]
> >    )
> > )
>
> So, do they need to compile each statement before
> understanding it?
> Or do they have some kind of mechanism of
> understanding statements as
> they are being built?
<snip>

If we take "understand" to mean that the incoming
statement is converted to a form compatible with the
internal data representation so that the contents of
the statement can be readily corelated with and
assimilated into the existing knowledge base, then the
statement is already understood as it is received
since it is already in the form that matches the
internal knowledge base.

--gary