On Sun, Jan 12, 2003 at 10:37:13AM -0500, Pei Wang wrote: > See my replies to Ben. As soon as the final answer (not intermidiate > answer) depends on internal state, we are not talking about the same Turing > Machine anymore. Of course you can build a thoery in this way, but it is > already not the current "thoery of computation".
How not? A single UTM can emulate any TM representing NARS in some state dealing with the problem of "replying to Ben's e-mail", and emulate the process of generating the new TM from the old TM. Nothing magical about transformations of Turing machines. How are you going beyond anything? It's not whether NARS always acts like a TM, it's whether a UTM can act like NARS. NARS is running on computers, clearly the answer is yes. -xx- Damien X-) ------- To unsubscribe, change your address, or temporarily deactivate your subscription, please go to http://v2.listbox.com/member/?[EMAIL PROTECTED]
