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
150 The intrinsic computational difficulty of functions – A Cobham - 1964
38 Classes of predictably computable functions – R W Ritchie - 1963
58 Subrecursion: Functions and Hierarchies – H E Rose - 1984
57 Ramified recurrence and computational complexity I: Word recurrence and poly-time – Daniel Leivant - 1994
36 A New Characterization Of Type 2 Feasibility – Kapron Cook, S. A. Cook - 1996
162 Complexity theory of real functions – Ker-I Ko - 1991
375 On a theory of computation and complexity over the real numbers – L Blum, M Shub, S Smale - 1989
73 Recursion Theory on the Reals and Continuous-time Computation – Cristopher Moore - 1995
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
90 A language and axioms for explicit mathematics – S Feferman - 1975
121 Bounded Arithmetic, Bibliopolis – S R Buss - 1986
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
14 Function-algebraic characterizations of log and polylog parallel time – Stephen Bloch - 1994
11 Egyszerü példa eldönthetetlen aritmetikai problémára, Mate és fizikai lapok – L Kalmár - 1943
24 The Expressive Power of Higher-order Types or, Life without CONS – Neil D. Jones - 2001
29 An analog characterization of the Grzegorczyk hierarchy – Manuel Lameiras Campagnolo, Cristopher Moore - 2002
10 Computability over topological structures – Vasco Brattka - 2003