The way I see it, you could program a Turing Machine MF which has some finite "per-time-step" computation speed _n_, such that MF "knows" the following: 1: The

The way I see it, you could program a Turing Machine MF which has some finite "per-time-step" computation speed _n_, such that MF "knows" the following: 1: The general form/program for solving function F for any arbitrary number, _m_, of variables. 2: How to construct a Turing Machine MF' capable of performing _m_ "operations per-time-step", and programmed with 1. Even in his crazy-town world of redefined computation, the Turing Machine MF is capable of computing any computable function F, of any number of time-varying variables _m_. I.e. given such a function F, MF simply creates a suitable machine MF' and copies the output of MF' to its own output. Thus, MF computes F, albeit by proxy. QED, etc. It's possible that I'm now in some TM dual to his time-varying primal, but whatevs, I can do what I want. ADD: As far as the computability results that I am familiar with are concerned, without loss of generality one could also just assume that all Turing Machines have infinite speed. The necessity of introducing the concept of a "time-step" into the definition of Turing Machines only occurs when computation time is actually of interest. Though, for complexity results one could still assume infinite speed, albeit the number of operations would still need to be counted.