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.
Highly Cited
2012
Highly Cited
2012
Explanations for the persistence of violence in the eastern part of the Democratic Republic of Congo blame the incendiary actions… 
Highly Cited
2011
Highly Cited
2011
While traffic signals are necessary to safely control competing flows of traffic, they inevitably enforce a stop-and-go movement… 
Review
2008
Review
2008
Abstract The degradation of inland aquatic habitats caused by decades of human activities has led to worldwide efforts to… 
Review
2003
Review
2003
The ultimate goal of any treatment for autoimmune diseases is antigen- and/or site-specific suppression of pathology… 
Highly Cited
2003
Highly Cited
2003
Highly Cited
2002
Highly Cited
2002
The scaling of CMOS technology has progressed rapidly for three decades, but may soon come to an end because of power-dissipation… 
Highly Cited
2001
Highly Cited
2001
The purpose of this contribution is to identify some of the issues which need to be addressed in order to advance the… 
Highly Cited
1999
Highly Cited
1999
Amyloid fibrils comprising primarily the peptides Aβ40 and Aβ42 are a defining feature of the Alzheimer's disease (AD) brain, and… 
Highly Cited
1998
Highly Cited
1998
The optical absorption of the colloidal nanoparticles is investigated, formed by the UV illumination of aqueous solutions… 
Highly Cited
1996
Highly Cited
1996
An understanding of the causes of political repression has continually eluded researchers for the past decade. We argue that much…