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
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
12 Theories With Self-Application and Computational Complexity – Thomas Strahm - 2002
12 combinatory logic and positive safe induction – A Polytime Cantini
7 Polynomial time computable arithmetic. In Logic and Computation, Proceedings of a Workshop held at – F Ferreira - 1987
72 Foundations of Constructive Mathematics: Metamathematical Studies – Michael J Beeson - 1985
23 Proving programs and programming proofs – Michael J Beeson - 1986
11 Choice and uniformity in weak applicative theories – Andrea Cantini - 2005
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
73 Recursion Theory on the Reals and Continuous-time Computation – Cristopher Moore - 1995
29 An analog characterization of the Grzegorczyk hierarchy – Manuel Lameiras Campagnolo, Cristopher Moore - 2002
211 Bounded Arithmetic, Propositional Logic, and Complexity Theory – J Krajíček - 1995