💡 Words with a Similar Meaning to "Real computation"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| computable number | In mathematics, computable numbers are the real numbers that can be computed to within any desired precision by a finite, terminating algorithm. |
| theory of computation | In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones). |
| hyperreal numbernoun | (mathematics) Any of a set of numbers which extends the set of real numbers by including infinitesimals and infinities, and is used in nonstandard analysis. |
| quantum turing machine | A quantum Turing machine or universal quantum computer is an abstract machine used to model the effects of a quantum computer. |
| quantum complexity theory | the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational model based on quantum mechanics. |
| computational problem | In theoretical computer science, a computational problem is one that asks for a solution in terms of an algorithm. |
| computational complexity theorynoun | (mathematics, computer science) A theory focusing on classifying computational problems according to their resource usage, and relating these classes to each other. |
| model of computation | In computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output of a mathematical function is computed given an input. |
| hypercomputationnoun | (computing) Any of several forms of computation that are theoretically (or practically) impossible with current technology. |
| computational resource | In computational complexity theory, a computational resource is a resource used by some computational models in the solution of computational problems. |
| circuit complexity | In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of the Boolean circuits that compute them. |
| diophantine approximation | In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. |
| time complexitynoun | (computer science) The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms. |
| real analysisnoun | (mathematics) The branch of mathematics dealing with the real numbers and related structures. |
| arithmetic circuit complexity | In computational complexity theory, arithmetic circuits are the standard model for computing polynomials. |
| complexity classnoun | (computational complexity theory) A set of computational problems of related resource-based complexity. |
| index calculus algorithm | In computational number theory, the index calculus algorithm is a probabilistic algorithm for computing discrete logarithms. |
| reductionnoun | The act, process, or result of reducing. |
| computational science | Computational science, also known as scientific computing, technical computing or scientific computation, is a division of science, and more specifically the Computer Sciences, which uses advanced computing capabilities to understand and solve complex physical problems. |
| nondeterministic turing machinenoun | (computer science) A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read. |
Translate “Real computation” into Another Language
Pick a language — the word will be pre-filled in the translator.