Re: PHIL/AI: Humongous Lookup Table

Hara Ra (harara@shamanics.com)
Wed, 12 Feb 1997 22:31:51 -0800

CurtAdams@aol.com wrote:
>
> >Would the table fail the test if it responded saying, "I do not
> >understand. Could you please rephrase your statement?" <snip>

> Yes, it could get away with that once. <snip> The lookup table will quickly be
> exposed as having no ability to respond to novelty, if you choose to ckeck
> that.

Not. It all depends on the addressing, and if the table's reply is
included in the next address to the table an indefinite sequence of
varying replies can be constructed.

In other words, the table uses the entire previous conversation as its
input, which serves as a memory of what went before.

O---------------------------------O
| Hara Ra <harara@shamanics.com> |
| Box 8334 Santa Cruz, CA 95061 |
O---------------------------------O