Jisho

×
帰納的集合
Wikipedia definition
1. Recursive setIn computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more general class of sets consists of the recursively enumerable sets, also called semidecidable sets.
Read “Recursive set” on English Wikipedia
Read “帰納的集合” on Japanese Wikipedia
Read “Recursive set” on DBpedia

Discussions

to talk about this word.