The Church-Turing Thesis over Arbitrary Domains (2008)

by Udi Boker , Nachum Dershowitz
Citations:12 - 9 self

Documents Related by Co-Citation

838 Theory of Recursive Functions and Effective Computability – H Rogers - 1967
63 Computable algebra, general theory and theory of computable fields – Michael O Rabin - 1960
21 A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS – Nachum Dershowitz, Yuri Gurevich
7 Exact Exploration and Hanging Algorithms ⋆ – Andreas Blass, Nachum Dershowitz, Yuri Gurevich
115 Sequential abstract state machines capture sequential algorithms – Yuri Gurevich
6 The computable kernel of Abstract State Machines – Wolfgang Reisig - 2008
3 Quantum computing since Democritus. Lecture notes (2006). Available at http://www.scottaaronson.com/democritus/lec4.html (viewed June 3 – S Aaronson - 2011
6 N.: Comparing computational power – Udi Boker, Nachum Dershowitz
7 Towards a general theory of computability – R Montague
7 Acceptable notation. Notre Dame – S Shapiro - 1982
4 Three Paths to Effectiveness – Udi Boker, Nachum Dershowitz
1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
154 Computable Analysis - An Introduction – K Weihrauch - 2000
265 An unsolvable problem of elementary number theory – A Church - 1936
308 Classical Recursion Theory – P Odifreddi - 1989
382 On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines – L Blum, M Shub, S Smale - 1989
4 Constructive algebras I – A Mal’tsev - 1961
4 A notion of effectiveness in arbitrary structures – W M Lambert - 1968
3 The Influence of Domain Interpretations on Computational Models ⋆ – Udi Boker, Nachum Dershowitz