Recursively Enumerable

- Natural & Formal Sciences -
Mathematics & Logic Dictionary
Class of sets (languages) for which there exists a Turing machine that enumerates all members or, equivalently, accepts exactly the inputs in the set by halting and accepting on them; the machine may not halt on non-members.