recursively enumerable language

/R IY0 K ER1 S IH0 V L IY0 IH0 N UW0 M ER0 AH0 B AH0 L AE0 NG G W AH0 JH/

1
In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e., if there exists a Turing machine which will enumerate all valid strings of the language.

Translate “recursively enumerable language” into another language

Choose a language below to open the translator with English selected as the source language.