The Zuse-Fredkin hypothesis is a form of its "strong version," which compares the universe to the machine to which it applies.
Hofstadter's objection to this focuses on the "A" property of letters and Bingsjord's anonymous straw-man points out its failure for mind-like entities. The Zuse-Fredkin hypothesis is a form of its "strong version," which compares the universe to the machine to which it applies. Ackermann's function lends credence to this idea, which resulted from attempts to prove the Entscheidungsproblem unsolvable. Its two most important requirements are that functions be recursive and lambda-definable. FTP, what is this thesis that states that all naturally computable effective algorithms may be carried out by a Turing machine?
Hofstadter's objection to this focuses on the "A" property of letters and Bingsjord's anonymous straw-man points out its failure for mind-like entities.
Church-Turing thesis (accept either name until "Turing," Church-Turing hypothesis, Turing-Church thesis or hypothesis, etc.)