💡 Words with a Similar Meaning to "Turing computable 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. |
| 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. |
| recursive functionnoun | (computing) Any function that uses recursion and can call itself until a certain condition is met. |
| computability logicnoun | (computing, mathematics) a formal theory of computability |
| computability theorynoun | (computer science) The branch of the theory of computation that studies which problems are computationally solvable using different models. |
| total functionnoun | (mathematics) A function. |
| truth functionnoun | (mathematics, logic) A Boolean function whose value is interpreted as truth or falsity |
| mathematical function program | — |
| turing degreenoun | (computer science, logic) A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given number. |
| bounded functionnoun | (mathematics) Any function whose values remain bounded by some constant. |
| measurable functionnoun | (mathematics) Any well-behaved function of real numbers between measurable spaces. |
| multifunctionnoun | (mathematics) A multivalued function. |
| simple functionnoun | (mathematical analysis) Any complex-valued measurable function whose range is finite. |
| explicit functionnoun | (mathematics) Any function whose value may be directly calculated from the independent variable. |
| finite-state machinenoun | (computing theory) A formalism for describing computation, consisting of a finite set of states and a transition function describing when to move from one state to another. |
| 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?". |
| functional | Useful; serving a purpose, fulfilling a function. |
| compositenoun | A mixture of different components. |
| complexity functionnoun | (computing theory, of an algorithm) A function representing the computational complexity an algorithm. |
Translate “Turing computable function” into Another Language
Pick a language — the word will be pre-filled in the translator.