A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS

by Nachum Dershowitz , Yuri Gurevich
Citations:21 - 10 self

Documents Related by Co-Citation

115 Sequential abstract state machines capture sequential algorithms – Yuri Gurevich
838 Theory of Recursive Functions and Effective Computability – H Rogers - 1967
31 Ordinary Interactive Small-Step Algorithms – Andreas Blass, Yuri Gurevich - 2004
12 The Church-Turing Thesis over Arbitrary Domains – Udi Boker, Nachum Dershowitz - 2008
265 An unsolvable problem of elementary number theory – A Church - 1936
58 Abstract state machines capture parallel algorithms – Andreas Blass, Yuri Gurevich - 2003
1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
7 Acceptable notation. Notre Dame – S Shapiro - 1982
19 Algorithms: A quest for absolute definitions – Andreas Blass, Yuri Gurevich - 2003
6 The computable kernel of Abstract State Machines – Wolfgang Reisig - 2008
63 Computable algebra, general theory and theory of computable fields – Michael O Rabin - 1960
405 Evolving Algebras 1993: Lipari Guide – Yuri Gurevich - 1995
7 Reconsidering Turing’s Thesis: towards more realistic semantics of programs – Yuri Gurevich - 1984
19 A new thesis – Y Gurevich - 1985
66 Draft of the ASM Guide – Y Gurevich - 1997
10 Evolving Algebras: An Introductory Tutorial – Yuri Gurevich - 1991
5 Gödel on computability – Wilfried Sieg
8 On the concept of algorithm”, Uspekhi Mat. Nauk 8:4 – Andrei N Kolmogorov - 1953
4 Three Paths to Effectiveness – Udi Boker, Nachum Dershowitz