At 18:12 11/01/05 -0500, John M quotes Russell Standish writing: (if I am correct in the quotes).
4) For those who believe in Computationalism, the Turing model of computation implicitly requires this Time postulate.
Here I disagree a lot. Actually most models of computation does no require any Time Postulate. They need only Peano axioms of arithmetic. Time-steps of computations are build from the successor function : n -> n+1 Reasoning on computations needs no more than the induction axioms (See Podnieks page for the first order arithmetic axioms). Even quantum computation does not (really) need time, but that is a less obvious statement about which we can discuss later.
Bruno
http://iridia.ulb.ac.be/~marchal/