----- Original Message ----- From: "Ben Goertzel" <[EMAIL PROTECTED]>
> So let's look at NARS over the time-interval [s,t] corresponding to the > answering of an individual question... > > Over this time-interval > > "The NARS program plus its internal state at the time point s" > > is still modelable as a Turing machine, is it not? Yes, but since the system may never return to that internal state, it is no longer a TM, though it may be thought of as a sequence of TMs. 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 ------- To unsubscribe, change your address, or temporarily deactivate your subscription, please go to http://v2.listbox.com/member/?[EMAIL PROTECTED]
