Heterodox
First, the Church-Turing Thesis.The Church-Turing Thesis states that, given any effective procedure or method (or algorithm) by which the value of a mathematical function can be obtained, then that same function can also be computed and its value obtained automatically by a Turing machine (see Copeland 1997, “The Thesis and its History”).To be “effective,” the algorithm or procedure must have a finite number of instructions in a finite number of steps, and could in principle be done by a...
Read More »