It is common to identify the class of computable functions with the class of functions computable by the Turing machine. The identification is done on the ground of the famous Church-Turing thesis. In fact, the thesis justifies only one implication: computable function are Turing computable. The other implication is quite obviously false if computability means practical computability. I am not ...