> Once again, the interesting question is not "Is NARS a TM?", but
> "Is NARS a
> TM with respect to problem P?"  If the problem is "To answer
> Ben's email on
> `AI and compuation'", then the system is not a TM (though it may
> be a TM in
> many other senses).  For this reason, to discuss the computability and
> computational complexity of P because meaningless for such a system.
>
> Pei

I'm sorry but I still don't understand exactly what you mean by "Is computer
program-instance X a TM with respect to problem P"

Is this different from "Is computer program-instance X, at time t, a TM with
respect to problem P presented to it at time t"?

Because it seems like any computer program-instance X, at a given point in
time, is modelable as a TM with respect to a problem P presented to it at
time t.

To get more concrete, suppose we carry out the following experiment:

"Take a specific NARS instance in a particular state.  Call it X.  Give it a
query in a specific format, which asks it to sort a list of n numbers.
Then, calculate the amount of time X takes before it delivers a correct
answer to the question (a correct sorting of the list) in a specified
format."

We can replicate the NARS instance X on  many different machines, hence we
can make a statistical study of this.  With insanely machines, we could try
it for every possible list of n numbers.

By carrying out this experiment, we could calculate the worst case and
average case time complexity of this particular NARS instance as a sorting
algorithm.

This seems to me to be "discussing the computational complexity of a problem
for NARS", and it doesn't seem to be meaningless...

The conceptual problem here is the "particular state" assumption, right?
You can't get rid of it by averaging over all particular states, all
particular environments in the history of the system, whatever -- because
you wouldn't know what realistic pdf to use in doing the
weighted-averaging...

-- Ben G








-- Ben


-------
To unsubscribe, change your address, or temporarily deactivate your subscription, 
please go to http://v2.listbox.com/member/?[EMAIL PROTECTED]

Reply via email to