- recursively computable
- мат. рекурсивно вычислимый
Большой англо-русский и русско-английский словарь. 2001.
recursively computable
Смотреть что такое "recursively computable" в других словарях:
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
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … 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
Computable isomorphism — In computability theory two sets A and B are computably isomorphic or recursively isomorphic if there exists a bijective computable function f with f(A) = B. Two numberings ν and μ are called computably isomorphic if there exists a bijective… … Wikipedia
ICES Intertemporal Computable Equilibrium System — affects regional and world economies. The model has been developed at the Climate Change Modelling and Policy Research Programme of the Fondazione Eni Enrico Mattei – FEEM, a research institution in the field of sustainable development.… … Wikipedia
Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… … Wikipedia
Effective method — An effective method (also called an effective procedure) for a class of problems is a method for which each step in the method may be described as a mechanical operation and which, if followed rigorously, and as far as may be necessary, is bound… … Wikipedia
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
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Large countable ordinal — In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of… … Wikipedia
