 Because the word ‘computable’ is here being employed synonymously with ‘computable by an effective method’, this statement is entailed by the Church-Turing thesis, in conjunction with Turing’s result that there exist functions uncomputable by any standard Turing machine. However, to a casual reader of the technical literature, this statement and others like it may appear to say more than they in fact do. That a function is uncomputable, in this sense, by any past, present, or future real machine, does not entail that the function in question cannot be generated by some real machine (past, present, or future).