Sciweavers

64 search results - page 2 / 13
» Proving Church's Thesis
Sort
View
AMC
2006
131views more  AMC 2006»
13 years 5 months ago
How much can analog and hybrid systems be proved (super-)Turing
Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing machines. In a contrapositive way, they say that any model ...
Olivier Bournez
BSL
2008
98views more  BSL 2008»
13 years 5 months ago
A Natural Axiomatization of Computability and Proof of Church's Thesis
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...
Nachum Dershowitz, Yuri Gurevich
ECCC
2002
86views more  ECCC 2002»
13 years 5 months ago
Classical Physics and the Church-Turing Thesis
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence sugge...
Andrew Chi-Chih Yao
SYNTHESE
2008
82views more  SYNTHESE 2008»
13 years 5 months ago
Kripke's paradox and the Church-Turing thesis
Kripke (1982, Wittgenstein on rules and private language. Cambridge, MA: MIT Press) presents a rule-following paradox in terms of what we meant by our past use of "plus",...
Mark D. Sprevak