From: Phil Goetz (firstname.lastname@example.org)
Date: Sun Jan 30 2005 - 07:07:08 MST
> --- Ben Goertzel <email@example.com> wrote:
> > > This is a substantive hypothesis. Here's why
> > I disagree with it.
> > >
> > > Let I(P) = the best way to solve problem P
> > given infinite computing power.
> > >
> > > Let L(P) = the best way to solve problem P
> > given limited computing
> > > power; for the sake of definiteness, say a
> > nanotech supercomputer,
> > > which is the most we can plausibly hope to
> > get our hands on in the
> > > foreseeable future.
Ack. No wonder I was confused. L(M) usually means
the set of languages that can be parsed by algorithm M
or by machine type M or, in general, within
L(P, machine) means the set of languages that can
be parsed in polynomial time on a particular
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best spam protection around
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:00:50 MDT