This is bs. Turing machine deals with anything that can be


所有跟贴·加跟贴·新语丝读书论坛

送交者: steven 于 2008-01-09, 14:56:52:

回答: 因为多数脑行为认为牵涉模拟量运算。底下几人坚持二进数就行 由 短江学者 于 2008-01-09, 14:13:05:

encoded, even if the coding is arbitrary large. Turing machine is more powerful than quantum computer, in fact, quantum computer is in the class of BQP, which is a subset of PSPACE problem, which is a subset of Turing machine. Analog computer, in terms of computing power, cannot exceed Turing machine. People think analog computer is better because they confuse hypercomputing with analog. Hyper computing model is not even theoretical well defined.



所有跟贴:


加跟贴

笔名: 密码: 注册笔名请按这里

标题:

内容: (BBCode使用说明