Get started
Keyword

primitive recursive functions

Description: Primitive recursive functions are computable functions built from basic functions using composition and recursion with a fixed finite number of steps.
Wikidata ID: wiki/Q1570472
OpenAlex ID: keywords/primitive-recursive-functions
Extensions of some theorems of Gödel and Church
1936 · Barkley Rosser · Journal of Symbolic Logic · 339
LTL with the freeze quantifier and register automata
2009 · Stéphane Demri, Ranko Lazić · ACM Transactions on Computational Logic · 256
Computability, complexity, and languages: fundamentals of theoretical computer science
1994 · Choice Reviews Online · 255
On the generative power of transformational grammars
1973 · P Peters · Information Sciences · 244
Nicht konstruktiv beweisbare Sätze der Analysis
1949 · Ernst Specker · Journal of Symbolic Logic · 240
An inverse of the evaluation functional for typed lambda -calculus
2002 · U. Berger, H. Schwichtenberg · Proceedings - Symposium on Logic in Computer Science · 198
Ologs: A Categorical Framework for Knowledge Representation
2012 · David I. Spivak, Robert E. Kent · PLoS ONE · 160
PDF
On the size of machines
1967 · Manuel Blum · Information and Control · 136
PDF
Abstract first order computability. I, II
1969 · Yiannis N. Moschovakis · Transactions of the American Mathematical Society · 134
PDF
Programmability of Chemical Reaction Networks
2009 · Matthew Cook, David Soloveichik, et al. · Natural computing series · 131
PDF
Algebras of feasible functions
1983 · Yuri Gurevich · Annual Symposium on Foundations of Computer Science · 107
Inductive Datatypes in HOL — Lessons Learned in Formal-Logic Engineering
1999 · Stefan Berghofer, Markus Wenzel · Lecture notes in computer science · 105
Query Languages for Bags and Aggregate Functions
1997 · Leonid Libkin, Limsoon Wong · Journal of Computer and System Sciences · 105
Termination proofs and the length of derivations
1989 · Dieter Hofbauer, Clemens Lautemann · Lecture notes in computer science · 96
Primitive recursive functions
1947 · Raphael M. Robinson · Bulletin of the American Mathematical Society · 89
PDF
Classes of computable functions defined by bounds on computation
1969 · E. M. McCreight, A. R. Meyer · ACM Symposium on Theory of Computing (STOC) · 88
The realm of primitive recursion
1988 · Harold Simmons · Archive for Mathematical Logic · 78
General Recursive Functions
1950 · Julia Robinson · Proceedings of the American Mathematical Society · 78
PDF
Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
1996 · Ulrich Kohlenbach · Archive for Mathematical Logic · 71
Incompleteness along paths in progressions of theories
1962 · S. Feferman, C. Spector · Journal of Symbolic Logic · 70
Superconcentrators, generalizers and generalized connectors with limited depth
1983 · Danny Dolev, Cynthia Dwork, et al. · 68
Classes of recursive functions based on Ackermann’s function
1965 · Robert Ritchie · Pacific Journal of Mathematics · 68
PDF
Some facts about Kurt Gödel
1981 · Hao Wang · Journal of Symbolic Logic · 65
The Reachability Problem for Petri Nets is Not Primitive Recursive
2022 · Jerome Leroux · Annual Symposium on Foundations of Computer Science · 63
PDF
Unbounded fan-in circuits and associative functions
1983 · Ashok K. Chandra, Steven Fortune, et al. · 62
Works count: 766
Citation count: 6,407
Year
Topic
Type