The Church-Turing Thesis over Arbitrary Domains

The Church-Turing Thesis over Arbitrary Domains (2008)

by Udi Boker , Nachum Dershowitz

Citations:

714	Theory of recursive functions and effective computability, McGraw-Hill – H Rogers - 1967
54	Computable algebra, general theory and theory of computable fields – M O Rabin - 1960
10	A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS – Nachum Dershowitz, Yuri Gurevich
104	Sequential abstract state machines capture sequential algorithms – Yuri Gurevich
4	Exact Exploration and Hanging Algorithms ⋆ – Andreas Blass, Nachum Dershowitz, Yuri Gurevich
7	Towards a general theory of computability – R Montague
3	Three Paths to Effectiveness – Udi Boker, Nachum Dershowitz
4	2008): The Computable Kernel of Abstract State Machines – Wolfgang Reisig - 1016
283	Classical Recursion Theory – P Odifreddi - 1999
914	On computable numbers, with an application to the “Entscheidungsproblem – A Turing
5	N.: Comparing computational power – U Boker, Dershowitz
112	Computable Analysis: an Introduction – Klaus Weihrauch - 2000
4	Constructive algebras I – A Mal’tsev - 1961
4	A notion of effectiveness in arbitrary structures – W M Lambert - 1968
5	Acceptable notation. Notre Dame – S Shapiro - 1982
2	The Influence of Domain Interpretations on Computational Models ⋆ – Udi Boker, Nachum Dershowitz
9	Some philosophical implications of mathematical logic I. Three classes of ideas – J Myhill - 1952
16	2003): On Gurevich’s Theorem on Sequential Algorithms – Wolfgang Reisig - 2010
384	Evolving Algebras 1993: Lipari Guide – Yuri Gurevich - 1995