-
1 recursively enumerable
перечислимый, рекурсивно перечислимыйБольшой англо-русский и русско-английский словарь > recursively enumerable
-
2 recursively enumerable
1) перечислимый
2) рекурсивно перечислимый -
3 recursively enumerable
Универсальный англо-русский словарь > recursively enumerable
-
4 recursively enumerable
рекурсивно перечислимыйEnglish-Russian dictionary of technical terms > recursively enumerable
-
5 recursively enumerable
English-Russian scientific dictionary > recursively enumerable
-
6 recursively enumerable set
рекурсивно перечислимое множество
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > recursively enumerable set
-
7 recursively enumerable set
Большой англо-русский и русско-английский словарь > recursively enumerable set
-
8 recursively enumerable class
Математика: рекурсивно перечислимый классУниверсальный англо-русский словарь > recursively enumerable class
-
9 recursively enumerable cylinder
Математика: рекурсивно перечислимый цилиндрУниверсальный англо-русский словарь > recursively enumerable cylinder
-
10 recursively enumerable degree
Математика: рекурсивно перечислимая степеньУниверсальный англо-русский словарь > recursively enumerable degree
-
11 recursively enumerable index
Математика: рекурсивно перечислимый индексУниверсальный англо-русский словарь > recursively enumerable index
-
12 recursively enumerable ordinal
Математика: рекурсивно перечислимое порядковое числоУниверсальный англо-русский словарь > recursively enumerable ordinal
-
13 recursively enumerable predicate
Математика: рекурсивно перечислимый предикатУниверсальный англо-русский словарь > recursively enumerable predicate
-
14 recursively enumerable problem
Математика: рекурсивно перечислимая проблемаУниверсальный англо-русский словарь > recursively enumerable problem
-
15 recursively enumerable relation
Математика: рекурсивно перечислимое отношениеУниверсальный англо-русский словарь > recursively enumerable relation
-
16 recursively enumerable sequence
Математика: рекурсивно перечислимая последовательностьУниверсальный англо-русский словарь > recursively enumerable sequence
-
17 recursively enumerable set
1) Математика: рекурсивно перечислимое множество2) Логика: рекурсивно-перечислимое множествоУниверсальный англо-русский словарь > recursively enumerable set
-
18 recursively enumerable sets
Программирование: рекурсивно перечислимые множестваУниверсальный англо-русский словарь > recursively enumerable sets
-
19 recursively enumerable structure
Математика: рекурсивно перечислимая структураУниверсальный англо-русский словарь > recursively enumerable structure
-
20 recursively enumerable subclass
Математика: рекурсивно перечислимый подклассУниверсальный англо-русский словарь > recursively enumerable subclass
См. также в других словарях:
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