Sciweavers

21 search results - page 1 / 5
» A Natural Axiomatization of Computability and Proof of Churc...
Sort
View
BSL
2008
98views more  BSL 2008»
13 years 11 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
BIRTHDAY
2008
Springer
14 years 26 days ago
The Church-Turing Thesis over Arbitrary Domains
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
Udi Boker, Nachum Dershowitz
AMC
2006
79views more  AMC 2006»
13 years 11 months ago
Church's thesis meets the N-body problem
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
Warren D. Smith
SYNTHESE
2008
82views more  SYNTHESE 2008»
13 years 10 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
CSR
2007
Springer
14 years 5 months ago
Proving Church's Thesis
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
Yuri Gurevich