- recursively enumerable set
- лог. рекурсивно-перечислимое множество
Большой англо-русский и русско-английский словарь. 2001.
recursively enumerable set
Смотреть что такое "recursively enumerable set" в других словарях:
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… … Wikipedia
Recursively enumerable language — In mathematics, logic and computer science, a recursively enumerable language is a type of formal language which is also called partially decidable or Turing acceptable. It is known as a type 0 language in the Chomsky hierarchy of formal… … Wikipedia
co-recursively enumerable — adjective Describing a set for which there exists a deterministic algorithm that will list all items not in that set. Any recursively enumerable set which is also co recursively enumerable is a decidable set … Wiktionary
recursively enumerable — adjective Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others … Wiktionary
Set (mathematics) — This article gives an introduction to what mathematicians call intuitive or naive set theory; for a more detailed account see Naive set theory. For a rigorous modern axiomatic treatment of sets, see Set theory. The intersection of two sets is… … Wikipedia
Set theory — This article is about the branch of mathematics. For musical set theory, see Set theory (music). A Venn diagram illustrating the intersection of two sets. Set theory is the branch of mathematics that studies sets, which are collections of objects … Wikipedia
Simple set — In recursion theory a simple set is an example of a set which is recursively enumerable but not recursive. Definition A subset S of the natural numbers N is called simple if it satisfies the following properties # N S is infinite and contains no… … Wikipedia
Recursive set — In 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… … Wikipedia
Countable set — Countable redirects here. For the linguistic concept, see Count noun. Not to be confused with (recursively) enumerable sets. In mathematics, a countable set is a set with the same cardinality (number of elements) as some subset of the set of… … Wikipedia
Empty set — ∅ redirects here. For similar looking symbols, see Ø (disambiguation). The empty set is the set containing no elements. In mathematics, and more specifically set theory, the empty set is the unique set having no elements; its size or cardinality… … Wikipedia
Class (set theory) — In set theory and its applications throughout mathematics, a class is a collection of sets (or sometimes other mathematical objects) which can be unambiguously defined by a property that all its members share. The precise definition of class… … Wikipedia
