claim
The equivalence between Turing, Church, and von Neumann formulations of computation refers to the class of functions solvable by each formalism, not an equivalence of the effective methods used to solve them.

Authors

Sources

Referenced by nodes (1)