No at all, non-Turing and non-algorithmic are equaivlent
所有跟贴·加跟贴·新语丝读书论坛
送交者: steven 于 2008-01-09, 15:36:09:
回答: sorry non-Turing, non-algorithmic is too vague 由 短江学者 于 2008-01-09, 14:01:01:
and well defined. Non-Turing means that a problem that cannot be solve by Turing machine, which is equivalent to say cannot be solve by any algorithm.
所有跟贴:
加跟贴