Everything about Elementary recursive function
Concept in computability theory
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 as a subset of the primitive recursive functions â specifically, those that can be computed using a limited set of operations such as composition, bounded sums, and bounded products. These functions grow no faster than a fixed-height tower of exponentiation. Not all primitive recursive functions are elementary; for example, tetration grows too rapidly to be included in the elementary class. The elementary recursive functions correspond to the class of the Grzegorczyk hierarchy. Wikipedia â
đ§ Start here: a 6-step reading path
- Read the overview: Elementary recursive functionA 5-minute orientation
- Pick up a classic book: Discrete and combinatorial mathematicsThe most-reprinted book on the subject
- Read the landmark paper: Characterizing the elementary recursive functions by a fragment of GĂśdel's TCited 10 times
- Go sideways: LOOP (programming language)A closely related topic
- Go sideways: Primitive recursive functionA closely related topic
đ Definitions
No dictionary entry for this exact phrase.
đď¸ The subject at a glance
đ Landmark papers (most cited)
đ Books worth reading
Discrete and combinatorial mathematicsRalph P. Grimaldi ¡ 1985
Discrete mathematicsKenneth A. Ross ¡ 1985
Mathematical Methods in the Physical SciencesMary L. Boas, Mary Layne Boas ¡ 1966
Data structures and algorithms in JavaAdam Drozdek ¡ 2001
Fundamentals of data structures in CEllis Horowitz ¡ 1993
Elementary induction on abstract structuresYiannis N. Moschovakis ¡ 1974- đA decision method for elementary algebra and geometryTarski, Alfred. ¡ 1948
Discrete mathematics with graph theoryEdgar G. Goodaire ¡ 1998
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đ Related topics
- 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âŚ
- 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âŚ
- General recursive function In mathematical logic and computer science, a general recursive function, partial recursive function, or Îź-recursive function is a partial function fromâŚ
- Mu operator In computability theory, the Îź-operator, minimization operator, or unbounded search operator searches for the least natural number with a given propertyâŚ
- Exponentiation by squaring In mathematics and computer programming, exponentiating by squaring is a general method for fast computation of large positive integer powers of a numberâŚ
- Laguerre polynomials In mathematics, the Laguerre polynomials, named after Edmond Laguerre (1834â1886), are nontrivial solutions of Laguerre's differential equation: xyâł+(1âx)yâ˛+ny=âŚ
- AMâGM inequality In mathematics, the inequality of arithmetic and geometric means, or more briefly the AMâGM inequality, states that the arithmetic mean of a list of non-negativâŚ
- Algebraic normal form Algebraic normal form (ANF) is a representation of functions in boolean algebra. Formulas written in ANF are also known as ring sum normal form (RSNF orâŚ