definition
Church-Turing thesis is largely a stipulation
The claim that any mechanically computable function is Turing computable functions largely as a stipulation, because whenever a counterexample is proposed (e.g. truly random atomic decay computing a number sequence, or a river computing its bank erosion rate), people refine the notion of computation to exclude it as non-mechanical or non-reproducible.
definitionpending
Speaker
Ned BlockEvidence Quote
“I regard the Church-Turing thesis as really a... Certainly that if it's mechanical then it's Turing computable as a bit of a stipulation. But it's a reasonable stipulation.”
Created: 6/13/2026, 12:30:17 AM
Your notes
Loading notes...