Jisho

×
帰納的可算集合
Links
Wikipedia definition
1. Recursively enumerable set​In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing-recognizable if: There is an algorithm such that the set of input numbers for which the algorithm halts is exactly S. Or, equivalently, There is an algorithm that enumerates the members of S. That means that its output is simply a list of the members of S: s1, s2, s3, ... .
Read “Recursively enumerable set” on English Wikipedia
Read “帰納的可算集合” on Japanese Wikipedia
Read “Recursively enumerable set” on DBpedia

Discussions

to talk about this word.