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.