-
21 recursively enumerable subset
Математика: рекурсивно перечислимое подмножествоУниверсальный англо-русский словарь > recursively enumerable subset
-
22 recursively enumerable theory
Математика: рекурсивно перечислимая теорияУниверсальный англо-русский словарь > recursively enumerable theory
-
23 recursively enumerable set
лог. рекурсивно-перечислимое множествоEnglish-Russian dictionary of computer science and programming > recursively enumerable set
-
24 recursively enumerable set
• rekurzivno nabrojiv skup -
25 recursively enumerable set
zbiór rekurencyjnie przeliczalnyEnglish-Polish dictionary for engineers > recursively enumerable set
-
26 recursively enumerable class
English-Russian scientific dictionary > recursively enumerable class
-
27 recursively enumerable cylinder
English-Russian scientific dictionary > recursively enumerable cylinder
-
28 recursively enumerable degree
English-Russian scientific dictionary > recursively enumerable degree
-
29 recursively enumerable index
English-Russian scientific dictionary > recursively enumerable index
-
30 recursively enumerable ordinal
English-Russian scientific dictionary > recursively enumerable ordinal
-
31 recursively enumerable predicate
English-Russian scientific dictionary > recursively enumerable predicate
-
32 recursively enumerable problem
English-Russian scientific dictionary > recursively enumerable problem
-
33 recursively enumerable relation
English-Russian scientific dictionary > recursively enumerable relation
-
34 recursively enumerable sequence
English-Russian scientific dictionary > recursively enumerable sequence
-
35 recursively enumerable structure
мат. рекурсивно перечислимая структураEnglish-Russian scientific dictionary > recursively enumerable structure
-
36 recursively enumerable subclass
English-Russian scientific dictionary > recursively enumerable subclass
-
37 recursively enumerable subset
English-Russian scientific dictionary > recursively enumerable subset
-
38 recursively enumerable set
failure set — множество отказов; множество неудачных исходов
The English-Russian dictionary general scientific > recursively enumerable set
-
39 completely recursively enumerable class
Математика: вполне рекурсивно перечислимый классУниверсальный англо-русский словарь > completely recursively enumerable class
-
40 language that is not recursively enumerable
Программирование: неперечислимый языкУниверсальный англо-русский словарь > language that is not recursively enumerable
См. также в других словарях:
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
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
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
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Turing degree — Post s problem redirects here. For the other Post s problem , see Post s correspondence problem. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic … Wikipedia
Creative and productive sets — In computability theory, productive sets and creative sets are types of sets of natural numbers that have important applications in mathematical logic. They are a standard topic in mathematical logic textbooks such as Soare (1987) and Rogers… … Wikipedia
Computability — You might be looking for Computable function, Computability theory, Computation, or Theory of computation. Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within… … Wikipedia
Alpha recursion theory — In recursion theory, the mathematical theory of computability, alpha recursion (often written α recursion) is a generalisation of recursion theory to subsets of admissible ordinals alpha. An admissible ordinal is closed under Sigma 1(L alpha)… … Wikipedia
mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium