- semi-reducible
- полуприводимый, полусводимый
Большой англо-русский и русско-английский словарь. 2001.
semi-reducible
Смотреть что такое "semi-reducible" в других словарях:
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
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
Turing reduction — In computability theory, a Turing reduction from a problem A to a problem B, named after Alan Turing, is a reduction which solves A, assuming B is already known (Rogers 1967, Soare 1987). It can be understood as an algorithm that could be used to … 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
World-systems theory — The world systems theory (also known as the world systems analysis[1]) is a multidisciplinary, macro scale approach to world history and social change.[1][2] The world systems theory stresses that world systems (and not nation states) should be… … Wikipedia
Conic section — Types of conic sections: 1. Parabola 2. Circle and ellipse 3. Hyperbola … Wikipedia
Differential algebraic equation — In mathematics, differential algebraic equations (DAEs) are a general form of (systems of) differential equations for vector–valued functions x in one independent variable t, where is a vector of dependent variables and the system has as many… … Wikipedia
Álgebra de Lie — En matemática, un álgebra de Lie es la estructura algebraica que describe un conjunto de transformaciones infinitesimales. Su uso principal reside en el estudio de objetos geométricos tales como grupos de Lie y variedades diferenciables. El… … Wikipedia Español
Empiricism — John Locke, a leading philosopher of British empiricism This article is about the field of philosophy. For the album by Borknagar, see Empiricism (album). Empiricism is a theory of knowledge that asserts that knowledge comes only or primarily via … Wikipedia
Lie algebra representation — Lie groups … Wikipedia
Algorithmically random sequence — Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm. The definition applies equally well to sequences on any finite set of characters. Random sequences … Wikipedia
