2 ms·
Technically that is a conjecture known as the Church-Turing thesis, which states that any computable function can be computed by a Turing machine. Here "computa
by tsimionescu 5y ago
Technically that is a conjecture known as the Church-Turing thesis, which states that any computable function can be computed by a Turing machine. Here "computable function" uses the informal definition 'any function that a human can compute', not the formal definition of the recursive functions (which are proven to be solvable by a Turing machine).