|
|
Definition of Recursively enumerable
1. Adjective. (computing theory) Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Recursively Enumerable
Other Resources:
