Iddo Lev has a more practical answer:
http://www.stanford.edu/~iddolev/pulc/current_work.html

On 5/5/07, Lukasz Stafiniak <[EMAIL PROTECTED]> wrote:
On 5/4/07, Mike Dougherty <[EMAIL PROTECTED]> wrote:
> On 5/3/07, Lukasz Stafiniak <[EMAIL PROTECTED]> wrote:
> > On 5/3/07, Matt Mahoney <[EMAIL PROTECTED]> wrote:
> > >
> > > But how does Speagram resolve ambiguities like this one? ;-)
> > >
> > Generally, Speagram would live with both interpretations until one of
> > them fails or it gets a chance to ask the user.
>
> How would that be possible?  I don't even know how to imagine such a thing.
>
Well, we hope to implement Speagram on Nondeterministic Turing Machine
once they build it. ;-)


-----
This list is sponsored by AGIRI: http://www.agiri.org/email
To unsubscribe or change your options, please go to:
http://v2.listbox.com/member/?member_id=231415&user_secret=fabd7936

Reply via email to