💡 Words with a Similar Meaning to "Ackermann function"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| computable functionnoun | (computer science) A mathematical function that can be computed using an abstract computation machine such as Turing machine. |
| recursive functionnoun | (computing) Any function that uses recursion and can call itself until a certain condition is met. |
| computable analysisnoun | (mathematics, computing theory) Mathematical analysis of computable numbers and functions. |
| arithmetic functionnoun | (mathematical analysis) Any function that is defined for all positive integers, and has values that are either real or complex. |
| 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. |
| accumulatornoun | (literal) One who, or that which, accumulates. |
| freiman's theoremnoun | (mathematics) In additive combinatorics, a central result that indicates the approximate structure of sets whose sumset is small. It roughly states that if |A+A|/|A| is small, then A can be contained in a small generalized arithmetic progression. |
| anticommutatornoun | (mathematics) A function of two elements A and B, defined as AB + BA. |
| clarithmetic | — |
| primitive recursionnoun | (computing theory) Recursion to a fixed depth. |
| p-adic ordinalnoun | (number theory) A function of rational numbers, with prime number p as parameter, which is defined for some non-zero integer x as the largest integer r such that pʳ divides x; is defined for some non-zero rational number a/b as the p-adic ordinal of a minus the p-adic ordinal of b; and is defined for 0 as infinity. |
| partial function applicationnoun | (computer science) Alternative form of partial application. [(computer science) The process of fixing a number of arguments to a function, producing another function of smaller arity.] |
| turing computable functionnoun | (mathematics) Any function whose value may be computed using a Turing machine. |
| affine arithmeticnoun | (mathematical analysis, computing) A model for self-validated numerical analysis in which quantities are represented as affine combinations (called affine forms) of certain primitive variables that stand for sources of uncertainty in data or approximations made during computations. |
| kronecker symbolnoun | (number theory) (a/n) or (a|n), a generalization of the Jacobi symbol to all integers n. |
| 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?". |
| abel polynomialnoun | (mathematics) Any member of a certain polynomial sequence whose nth term is of the form p_n(x)=x(x-an)ⁿ⁻¹. |
| additive functionnoun | (mathematics) A unary function that preserves the addition operation; a unary function f such that for any x and y: f(x + y) = f(x) + f(y). |
| functional rootnoun | (mathematics) A function which, when applied a given number of times, equals another given function. |
| integrable functionnoun | (mathematics) Any function that possesses a finite integral |
Translate “Ackermann function” into Another Language
Pick a language — the word will be pre-filled in the translator.