Skip to search formSkip to main contentSkip to account menu

Halting problem

Known as: Determining whether a program is going to run forever, Halting predicate, The halting problem 
In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
While recent scientific efforts have resulted in a series of discoveries and advances in understanding and controlling the virus… 
2007
2007
The first offshore Marine Protected Area (MPA) in the United Kingdom (UK) is the Darwin Mounds, an area of Lophelia pertusa… 
2006
2006
OR THE PAST 100 YEARS, THE UTIL-ity's job has been to keep the " lights on. " For today's highly automated factories and… 
Highly Cited
2004
Highly Cited
2004
We demonstrate a bulk process for the synthesis of Y-junction carbon nanotubes using Ti-doped Fe catalysts. It is shown that the… 
2002
2002
Signature-based anti-virus (AV) software is running a losing race. Malicious code writers persistently out-pace the efforts of AV… 
1996
1996
Many new domains for genetic programming require evolved programs to be executed for longer amounts of time. For these… 
Review
1996
Review
1996
The increased data rates and reliability required to support emerging multimedia applications require new communications… 
1995
1995
Recent proposals, particularly those emanating from Thabo Mbeki, to privatise state corporations in order to finance the… 
1980
1980
In the Netherlands the average production of sewage is appr. 50 m' per PE (population equivalent) per year, containing appr. 1 kg… 
1969
1969
An urban freeway is treated as a dynamic process. A state model for the freeway is obtained with sectional traffic densities as…