Definitions from Wiktionary (Turing complete)
▸ adjective: (computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete.
▸ Words similar to Turing complete
▸ Usage examples for Turing complete
▸ Idioms related to Turing complete
▸ Wikipedia articles (New!)
▸ Popular nouns described by Turing complete
▸ Words that often appear near Turing complete
▸ Rhymes of Turing complete
▸ Invented words related to Turing complete
▸ adjective: (computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete.
Similar:
Turing-complete,
functionally complete,
P-complete,
complete,
bicomplete,
clockable,
superrecursive,
semicomputable,
NP-complete,
recursive,
more...
Opposite:
▸ Words similar to Turing complete
▸ Usage examples for Turing complete
▸ Idioms related to Turing complete
▸ Wikipedia articles (New!)
▸ Popular nouns described by Turing complete
▸ Words that often appear near Turing complete
▸ Rhymes of Turing complete
▸ Invented words related to Turing complete