Turing Oversold?
We&#x27;ve been over this. Gödel&#x27;s mu-recursive functions were a poor model of computation because it&#x27;s completely unclear how to physically implement the arbitrary-function minimization operator. So people didn&#x27;t see how to build a machine that calculates this way. Similarly, there&#x27;s no clear way how to mechanize lambda calculus.<p>Turing Machines, on the other hand, were instantly obviously mechanizable. It was clear that one could build a physical machine to run any Turing program without human input. By proving that they could simulate the other systems, Turing showed that those other systems could be mechanizable as well.<p>I don&#x27;t understand why Schmidhuber continues to ignore this crucial point.