Definitions from Wiktionary (superrecursive)
▸ adjective: (computing theory) Being a generalization of ordinary algorithms that are more powerful than Turing machines.
▸ Words similar to superrecursive
▸ Usage examples for superrecursive
▸ Idioms related to superrecursive
▸ Wikipedia articles (New!)
▸ Popular nouns described by superrecursive
▸ Words that often appear near superrecursive
▸ Rhymes of superrecursive
▸ Invented words related to superrecursive
▸ adjective: (computing theory) Being a generalization of ordinary algorithms that are more powerful than Turing machines.
Similar:
transrecursive,
recursive,
functionally complete,
subrecursive,
recursively enumerable,
primitive recursive,
hyperarithmetic,
co-recursive,
superregular,
Turing complete,
more...
Opposite:
▸ Words similar to superrecursive
▸ Usage examples for superrecursive
▸ Idioms related to superrecursive
▸ Wikipedia articles (New!)
▸ Popular nouns described by superrecursive
▸ Words that often appear near superrecursive
▸ Rhymes of superrecursive
▸ Invented words related to superrecursive