- program halting
- останов (выполнения) программы, программный останов
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
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
halting problem — The fundamental decision problem in the theory of computation. It is the problem of finding whether there is an effective procedure for telling whether a Turing machine computation ever terminates, for an arbitrary input. The negative solution is … Philosophy dictionary
halting problem — noun The problem of deciding in finite time whether any program will finish running in finite time, when given a certain finite input … Wiktionary
Static program analysis — This article is about certain software quality assessment methods. For the statistical method, see Static analysis. Static program analysis (also Static code analysis or SCA) is the analysis of computer software that is performed without actually … Wikipedia
Presidential $1 Coin Program — Presidential One Dollar Coin United States Value 1 U.S. dollar Mass 8.100 g (0.26 troy oz) Diameter 26.5 mm (1.043 in) Thickness … Wikipedia
Test Readiness Program — The Test Readiness Program was a United States Government program established in 1963 to maintain the necessary technologies and infrastructure for the atmospheric testing of nuclear weapons, should the treaty which prohibited such testing be… … Wikipedia
2057 (TV series) — infobox television | show name = 2057 genre = Future Reality runtime = 45 minutes starring = Michio Kaku country = USA network = Discovery Channel first aired = January 28, 2007 num episodes = 3 | website =… … Wikipedia
Chaitin's constant — In the computer science subfield of algorithmic information theory, a Chaitin constant or halting probability is a real number that informally represents the probability that a randomly constructed program will halt. These numbers are formed from … Wikipedia
Busy beaver — In computability theory, a busy beaver (from the colloquial expression for an industrious person) is a Turing machine that attains the maximum operational busyness (such as measured by the number of steps performed, or the number of nonblank… … 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