Everything about General recursive function
One of several equivalent definitions of a computable function
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursive function. In computability theory, it is shown that the μ-recursive functions are precisely the functions that can be computed by Turing machines. The μ-recursive functions are closely related to primitive recursive functions, and their inductive definition (below) builds upon that of the primitive recursive functions. However, not every total recursive function is a primitive recursive function—the most famous example is the Ackermann function. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: General recursive functionA 5-minute orientation
- Skim a recent paper: Nonparametric recursive method for moment generating function kernel-type estimatorsInfluential work since 2022
- Pick up a classic book: Computability and logicThe most-reprinted book on the subject
- Read the landmark paper: General recursive functions of natural numbersCited 305 times
- Go sideways: Primitive recursive functionA closely related topic
- Go sideways: Mu operatorA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
General recursive functions of natural numbers
General recursive functions
General recursive relation for the calculation of the local Green’s function in the resolvent-matrix approach
Recursive Computation of the Generalized Q Function
Algebraically Generalized Recursive Function Theory
Enumerations of families of general recursive functions
Enumeration of families of general recursive functions
Computable enumerations of families of general recursive functions
🆕 Influential since 2022
Nonparametric recursive method for moment generating function kernel-type estimators
Limit Theorems for General Recursive Regression Models Involving Weakly Dependent Functional Data
Semi-recursive estimation of multidimensional regression function using the generalised Bernstein polynomial
Nonparametric Recursive Kernel Type Eestimators for the Moment Generating Function Under Censored Data
đź“š Books worth reading
Computability and logicGeorge Boolos, Richard C. Jeffrey · 1974- 📕Enumerability, Decidability, ComputabilityHans Hermes, Gabor T. Herman · 1965
- 📕Recursive Identification and Parameter EstimationHan-Fu Chen, Wenxiao Zhao · 2014
Computations in higher typesJohan Moldestad · 1977
Recursive Functions and MetamathematicsRoman Murawski · 1999- 📕Syntactic simplificationAsa Kasher · 1963
Stochastic approximation and recursive algorithms and applicationsHarold J. Kushner · 2003
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Primitive recursive function In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all…
- Mu operator In computability theory, the μ-operator, minimization operator, or unbounded search operator searches for the least natural number with a given property…
- Kleene's recursion theorem In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions…
- 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…
- 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…
- Computable function Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes…
- Computability theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated…
- Algorithm characterizations Algorithm characterizations are attempts to formalize the word algorithm. Algorithm does not have a generally accepted formal definition. Researchers are…