[PDF][PDF] A formalization and proof of the Extended Church-Turing Thesis
N Dershowitz, E Falkovich - Studia Logica Conference on Trends in …, 2011 - cs.tau.ac.il
N Dershowitz, E Falkovich
Studia Logica Conference on Trends in Logic, IX: Church Thesis: Logic, Mind …, 2011•cs.tau.ac.ilThe Church-Turing Thesis [10, Thesis I†] asserts that all effectively computable numeric
functions are recursive and, likewise, that they can be computed by a Turing machine, or—
more precisely—can be simulated under some representation by a Turing machine. As
Kleene [11, p. 493] explains,
functions are recursive and, likewise, that they can be computed by a Turing machine, or—
more precisely—can be simulated under some representation by a Turing machine. As
Kleene [11, p. 493] explains,
The Church-Turing Thesis [10, Thesis I†] asserts that all effectively computable numeric functions are recursive and, likewise, that they can be computed by a Turing machine, or—more precisely—can be simulated under some representation by a Turing machine. As Kleene [11, p. 493] explains,
cs.tau.ac.il
Showing the best result for this search. See all results