Scholar's discussion on HIP as an alternative to AI/SW research
4/5/2004
2:35 PM
Response to an AI scholar: [17]
Turing machines are universal. They can perform any computation, provided we don't concern ourselves with how long it takes or whether it terminates.
The notion of universal can be questioned on a number of grounds.
The first challenge to this statement is one focused on the assumption that anything can be modeled as a computation. Clearly Penrose does not think so, and others do not think so either.
The second challenge has to do with the time that it takes to complete a computation. Clearly two kinds of constraints apply to time to completion of a thought or time to completion of a simulation (computation).
Comments to portal@ontologystream.com