💡 Words with a Similar Meaning to "Turing complete"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| turing-complete | Alternative spelling of Turing complete. [(computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete.] |
| functionally complete | (computing theory) Capable of computing any recursive function. |
| p-completenoun | (computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P. |
| complete | With all parts included; with nothing missing; full. |
| bicomplete | (mathematics, of a category) Both complete and cocomplete. |
| clockable | (transgender slang) Of a transgender person or drag performer: able to be clocked; capable of being noticed or recognized as transgender; not passing. |
| superrecursive | (computing theory) Being a generalization of ordinary algorithms that are more powerful than Turing machines. |
| semicomputablenoun | (mathematics, computer science) partially computable |
| np-complete | (computing theory, of a decision problem) That is both NP (solvable in polynomial time by a non-deterministic Turing machine) and NP-hard (such that any (other) NP problem can be reduced to it in polynomial time). |
| recursive | (computing, not comparable) of a program or function that calls itself |
| dominable | Subject to domination; able to be dominated. |
| cofinitenoun | (mathematics) Having a finite absolute complement. |
| computable | Capable of being computed, or enumerated. |
| completablenoun | That can be completed. |
| completely metrizable | (mathematical analysis) Of a set, that it is metrizable and, under such given metric, complete. |
| totalnoun | An amount obtained by the addition of smaller amounts. |
| functional | Useful; serving a purpose, fulfilling a function. |
| autoreducible | (mathematics, set theory) Of a set, that can be reduced to itself by a Turing machine that does not ask for its own input. |
| partial | Existing as a part or portion; incomplete. |
| deterministic | (computing, of an algorithm) For a given particular input, always producing the same output through the same sequence of states. |
Translate “Turing complete” into Another Language
Pick a language — the word will be pre-filled in the translator.