Live briefing
Everything about Primitive recursive function
Function computable with bounded loops
In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all "for" loops. Primitive recursive functions form a strict subset of those general recursive functions that are also total functions. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Primitive recursive functionA 5-minute orientation
- Skim a recent paper: Computability evaluation of RESTful API using Primitive Recursive FunctionInfluential work since 2022
- Pick up a classic book: Language and Automata Theory and ApplicationsThe most-reprinted book on the subject
- Read the landmark paper: Primitive recursive functionsCited 63 times
- Go sideways: General recursive functionA closely related topic
- Go sideways: Elementary recursive functionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Primitive recursive functions
A Hierarchy of Primitive Recursive Functions
Hierarchies of Primitive Recursive Functions
Primitive recursive functions. II
The first example of a recursive function which is not primitive recursive
A Class of Reversible Primitive Recursive Functions
Term rewriting theory for the primitive recursive functions
On primitive recursive wordfunctions
🆕 Influential since 2022
Computability evaluation of RESTful API using Primitive Recursive Function
On Correspondences between Feedforward Artificial Neural Networks on Finite Memory Automata and Classes of Primitive Recursive Functions
Enhancing Symbolic Manipulation through Pairing Primitive Recursive String Functions and Interplay with Generalized Pairing PRSF
PRIMITIVE RECURSIVE CATEGORICITY SPECTRA OF FUNCTIONAL STRUCTURES
On the Computability of Primitive Recursive Functions by Feedforward Artificial Neural Networks
📚 Books worth reading
Language and Automata Theory and ApplicationsAdrian-Horia Dediu · 2012
An introduction to computer scienceJean-Paul Tremblay, Richard B. Bunt · 1979
Languages and machinesThomas A. Sudkamp · 1988
Discrete mathematicsNorman Biggs · 1985
Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
An introduction to data structures with applicationsJean-Paul Tremblay, Paul Gordon Sorenson · 1976
Three Views of LogicDonald W. Loveland, Richard E. Hodel · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- General recursive function In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from…
- Elementary recursive function The term elementary was originally introduced by László Kalmár in the context of computability theory. He defined the class of elementary recursive functions…
- Mu operator In computability theory, the μ-operator, minimization operator, or unbounded search operator searches for the least natural number with a given property…
- Course-of-values recursion In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion. In a definition of a function…
- Grzegorczyk hierarchy The Grzegorczyk hierarchy (/ɡrɛˈɡɔːrtʃək/, Polish pronunciation: [ɡʐɛˈɡɔrt͡ʂɨk]), named after the Polish logician Andrzej Grzegorczyk, is a hierarchy of…
- LOOP (programming language) LOOP is a simple register language designed to precisely capture the primitive recursive functions. The language is derived from the counter-machine model…
- Implicit computational complexity Implicit computational complexity (ICC) is a subfield of computational complexity theory that characterizes programs by constraints on the way in which…
- Smn theorem In computability theory the S m n theorem, written also as "smn-theorem" or "s-m-n theorem" (also called the translation lemma, parameter theorem, and…