💡 Words with a Similar Meaning to "Recursion theory"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| 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. |
| recursionnoun | (mathematics) The act of defining an object (usually a function) in terms of that object itself. |
| primitive recursionnoun | (computing theory) Recursion to a fixed depth. |
| computability logicnoun | (computing, mathematics) a formal theory of computability |
| recurrence relationnoun | (mathematics) an equation that recursively defines a sequence; each term of the sequence is defined as a function of the preceding terms. |
| corecursionnoun | The dual to recursion, that acts on the computed result, rather than the input. |
| 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. |
| church-turing thesisnoun | (computing theory) A hypothesis about the nature of computable functions, stating that a function on the natural numbers can be calculated by an effective method if and only if it is computable by a Turing machine. |
| computable analysisnoun | (mathematics, computing theory) Mathematical analysis of computable numbers and functions. |
| infinite recursionnoun | (programming) Any recursion that continues without end. |
| inductive definitionnoun | (semantics) A recursive definition. |
| computation tree logicnoun | (computer science) A particular modal logic of branching time with operators "next", "globally", "finally" or "eventually", "until", and "weak until". |
| recursive definitionnoun | (semantics) A definition of a term within which the term itself appears, and that is well-founded, avoiding an infinite regress. |
| computable functionnoun | (computer science) A mathematical function that can be computed using an abstract computation machine such as Turing machine. |
| recreational mathematicsnoun | (mathematics) Any use of mathematics or logic whose primary purpose is recreation, though often with more serious characteristics. |
| turing computable functionnoun | (mathematics) Any function whose value may be computed using a Turing machine. |
| rewritingnoun | The process or result of writing again; a rewrite. |
| rice's theoremnoun | (computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable. |
| natural deductionnoun | A kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the "natural" way of reasoning, in contrast to axiomatic systems. |
Translate “Recursion theory” into Another Language
Pick a language — the word will be pre-filled in the translator.