The Influence of Domain . . .

The Influence of Domain . . . (2008)

Cached

Download Links

[www.cs.tau.ac.il]

by Udi Boker

BibTeX

@MISC{Boker08theinfluence,
    author = {Udi Boker},
    title = {The Influence of Domain . . . },
    year = {2008}
}

Bookmark

OpenURL

Abstract

Citations

714	Theory of recursive functions and effective computability, McGraw-Hill - Rogers - 1967
352	Computation: Finite and Infinite Machines - Minsky - 1967
263	Complexity and Real Computation - Blum, Cucker, et al. - 1998
214	An unsolvable problem of elementary number theory - Church - 1936
112	Computable Analysis: an Introduction - Weihrauch - 2000
104	Sequential abstract state machines capture sequential algorithms - Gurevich
97	Computability: An introduction to recursive function theory - Cutland - 1980
97	Systems of Logic Based on Ordinals - Turing - 1939
79	Computability and Complexity From a Programming Perspective - Jones - 1997
54	Computable algebra, general theory and theory of computable fields - Rabin - 1960
33	Recursive predicates and quantifiers - Kleene - 1943
27	Ordinary Interactive Small-Step Algorithms - Blass, Gurevich
26	Iteration, inequalities, and differentiability in analog computers - Campagnolo, Moore, et al.
23	Abstract versus concrete computation on metric partial algebras - Tucker, Zucker
21	Computability, volume 9 - Weihrauch - 1987
19	Domain representations of topological spaces - Blanck - 2000
18	Why Gödel didn’t have Church’s Thesis - Davis - 1982
17	Introduction to Computability - Hennie - 1977
16	Formal Languages: Automata and Structures - Engeler - 1968
16	Real recursive functions and their hierarchy - Mycka, Costa
13	Recursion theory - Shoenfield - 1993
12	An abstract model for parallel computation: Gandy’s thesis - Sieg, Byrnes - 1998
10	A natural axiomatization of computability and proof of Church’s thesis - Dershowitz, Gurevich
10	The Theory of Computability - Sommerhalder, Westrhenen - 1988
9	Some philosophical implications of mathematical logic I. Three classes of ideas - Myhill - 1952
8	The Church-Turing thesis over arbitrary domains - Boker, Dershowitz
8	Eds.): “Interactive Computation: The New Paradigm - Goldin, Smolka, et al. - 2006
8	mind and models - Matter - 1965
7	Towards a general theory of computability - Montague
6	Computability over an arbitrary structure. sequential and parallel polynomial time. FoSSaCS - Bournez, Cucker, et al. - 2003
6	A two counter machine cannot calculate 2 n - Schroeppel - 1972
5	N.: Comparing computational power - Boker, Dershowitz
5	Recursive and recursively enumerable orders - Rice - 1956
5	Acceptable notation. Notre Dame - Shapiro - 1982
4	Glossary of Z notation - Bowen - 1995
4	A notion of effectiveness in arbitrary structures - Lambert - 1968
4	Constructive algebras I - Mal’tsev - 1961
3	How to compare the power of computational models - Boker, Dershowitz - 2005
3	Effective procedures in field theory, Philosophical transactions of the Royal - Fröhlich, Shepherdson - 1956
2	Abstract and Concrete Categories The Joy of Cats. 2005. Available at: http://www.math. uni-bremen.de/ ∼ dmb/acc.pdf - Adámek, Herrlicha, et al.
2	About one class of Turing machines (Minsky machines). Algebra and Logic (seminar), 1(6):42–51 - Barzdins - 1962
2	The influence of domain interpretations on computational models - Boker, Dershowitz
2	Comparing the Church and Turing approaches: Two prophetical messages. In The Universal Turing Machine: A halfcentury survey - Trakhtenbrot - 1988
1	Algorithms and Programs. An Introduction to the Theory of Programming Languages, Computability and Complexity. The Academic College of Tel-Aviv Yaffo, 2002 - Ben-Amram
1	Abstract effective models - Boker, Dershowitz
1	A hypercomputational alien - Boker, Dershowitz
1	without dogma: Axioms for computability - Church - 2007