A language is computably enumerable (synonyms: recursively enumerable , semidecidable ) if there is a computable function f such that f(w) is defined if and only if the word w is in the language.

• 必须开发某种编码系统来允许可计算函数来接受在语言中的任意字作为输入；