Wpc/enumerable language

Also known as:

Recursively enumerable language

Definition:

A formal language for which there exists an algorithm which, given string X, answers yes iff X belongs in the language.

Generalizations:

• formal language (no computational requirement)

Specializations:

• decidable language (algorithm stops on all inputs)

Involved in:

• [co-enumerable language]? (complement of an enumerable language)

---

Relevant Wikipedia Articles:

the concept- decidable language

related field(s)- theory of computation

potential real-world examples-

---

/Discussion?