💡 Words with a Similar Meaning to "Primitive recursion"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| infinite recursionnoun | (programming) Any recursion that continues without end. |
| recursionnoun | (mathematics) The act of defining an object (usually a function) in terms of that object itself. |
| recursive descentnoun | (computing theory) A kind of top-down parsing involving a set of mutually recursive procedures, each of which implements one of the non-terminals of the grammar, so that the structure of the parser program closely mirrors that of the grammar. |
| recursion theorynoun | (logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function on the natural numbers to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?". |
| computability theorynoun | (computer science) The branch of the theory of computation that studies which problems are computationally solvable using different models. |
| kleene's recursion theoremnoun | (computing theory) Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions. |
| base casenoun | The part of a recursive definition or algorithm that is not defined in terms of itself. |
| recursive definitionnoun | (semantics) A definition of a term within which the term itself appears, and that is well-founded, avoiding an infinite regress. |
| treenoun | A perennial woody plant taller and larger than a shrub with a wooden trunk and, at some distance from the ground, having leaves and branches. |
| corecursionnoun | The dual to recursion, that acts on the computed result, rather than the input. |
| iterative deepening searchnoun | (computer science, graph theory) A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage. |
| recurrence relationnoun | (mathematics) an equation that recursively defines a sequence; each term of the sequence is defined as a function of the preceding terms. |
| recursive functionnoun | (computing) Any function that uses recursion and can call itself until a certain condition is met. |
| inductive definitionnoun | (semantics) A recursive definition. |
| functional rootnoun | (mathematics) A function which, when applied a given number of times, equals another given function. |
| back substitutionnoun | (linear algebra) A method of solving linear systems that have been transformed into row echelon form. |
| subcyclingnoun | (mathematics, computing) An algorithmic technique involving integration with progressively smaller steps |
| foldnoun | An act of folding. |
| rootfindingnoun | (mathematics) The process of finding the root of an equation. |
| infinite regressnoun | (logic) A regress into an infinite sequence of propositions in an attempt to found the truth of the proposition Pᵢ on the truth of the proposition Pᵢ₊₁. |
Translate “Primitive recursion” into Another Language
Pick a language — the word will be pre-filled in the translator.