Jisho

×
帰納的可算言語
Links
Wikipedia definition
1. Recursively enumerable language​In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable or Turing-acceptable) 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. Recursively enumerable languages are known as type-0 languages in the Chomsky hierarchy of formal languages.
Read “Recursively enumerable language” on English Wikipedia
Read “帰納的可算言語” on Japanese Wikipedia
Read “Recursively enumerable language” on DBpedia

Discussions

to talk about this word.