Its "strong" version declares that computing non-recursive functions is physically impossible because the universe itself is the type of machine to which it applies.
Its "strong" version declares that computing non-recursive functions is physically impossible because the universe itself is the type of machine to which it applies. It defines an "effective and mechanical" method as containing a finite set of simple and precise instructions described with a finite number of symbols, producing a finite number of steps, and requiring only paper, pencil, and the minimum intelligence to execute the instructions. For ten points, name this thesis which seeks to define a computable algorithm as any which can be carried out by a certain tape-based computer-like machine.
Its "strong" version declares that computing non-recursive functions is physically impossible because the universe itself is the type of machine to which it applies.
Church-Turing thesis [accept either or both names]