- complete formalization
- мат. полная формализация
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Unexpected hanging paradox — The unexpected hanging paradox is an alleged paradox about a prisoner s response to an unusual death sentence. It is alternatively known as the hangman paradox, the fire drill paradox, or the unexpected exam (or pop quiz) paradox.Despite… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Closed world assumption — The closed world assumption (CWA) is the presumption that what is not currently known to be true, is false. The same name also refers to a logical formalization of this assumption by Raymond Reiter. The opposite of the closed world assumption is… … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
PROSODY, HEBREW — This article is a survey of the history of Hebrew poetic forms from the Bible to the present time. The entry is arranged according to the following outline: introduction the variety of formal systems the specific nature of hebrew literary history … Encyclopedia of Judaism
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
New algebra — The new algebra or symbolic analysis is a formalization of algebra promoted by François Viète in 1591 and by his successors (after 1603). It marks the beginning of the algebraic formalization (late sixteenth the early seventeenth centuries).… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Kleene's T predicate — In computability theory, the T predicate, first studied by mathematician Stephen Cole Kleene, is a particular set of triples of natural numbers that is used to represent computable functions within formal theories of arithmetic. Informally, the T … Wikipedia
Sufism — This article is part of the series … Wikipedia
Kolmogorov complexity — In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Soviet Russian… … Wikipedia