Computation Models and Function Algebras

by P. Clote
Citations:37 - 2 self

Documents Related by Co-Citation

179 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
151 The intrinsic computational difficulty of functions – A Cobham - 1965
38 Classes of predictably computable functions – R W Ritchie - 1963
57 Predicative recurrence and computational complexity I: word recurrence and poly-time – D Leivant - 1994
58 Subrecursion: Functions and Hierarchies – H E Rose - 1984
91 A language and axioms for explicit mathematics – S Feferman - 1975
121 Bounded Arithmetic, Bibliopolis – S R Buss - 1986
36 A New Characterization Of Type 2 Feasibility – Kapron Cook, S. A. Cook - 1996
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
162 Complexity Theory of Real Functions – K-I Ko - 1991
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
73 Recursion Theory on the Reals and Continuous-time Computation – Cristopher Moore - 1995
12 Theories With Self-Application and Computational Complexity – Thomas Strahm - 2002
72 Foundations of Constructive Mathematics: Metamathematical Studies – Michael J Beeson - 1985
12 combinatory logic and positive safe induction – A Polytime Cantini
11 Choice and uniformity in weak applicative theories – Andrea Cantini - 2005
7 Polynomial time computable arithmetic. In Logic and Computation, Proceedings of a Workshop held at – F Ferreira - 1987
23 Proving programs and programming proofs – Michael J Beeson - 1986
14 Function-algebraic characterizations of log and polylog parallel time – Stephen Bloch - 1994