(Solved) : Church S Thesis Makes Claim Reasonable Formal Models Computa Tion Equivalent Showed Secti Q34901594 . . . .

Church’s Thesis makes the claim that all reasonable formal models of computa- tion are equivalent. And we showed in. Section 17.4. a construetion that proved that a simple accumulator/register machine can be implemented as a Turing ma- chine. By extending that construction, we can show that any computer can be im- plemented as a Turing machine. So the existence of a decision procedure (stated in any notation that makes the algorithm clear) to answer a question means