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
Across the world, ‘green grabbing’ – the appropriation of land and resources for environmental ends – is an emerging process of… 
Highly Cited
2004
Highly Cited
2004
Much as Rachel Carson's "Silent Spring" was a call to action against the pesticides that were devastating bird populations… 
Highly Cited
2004
Highly Cited
2004
Acid soils occupy approximately 30% or 3950 m ha of the world's ice free land area and occur mainly in two global belts where… 
Review
2001
Review
2001
This review article posits that the scarcity of women at the upper levels of organizations is a consequence of gender bias in… 
Highly Cited
2000
Highly Cited
2000
  • G. Paun
  • J. Comput. Syst. Sci.
  • 2000
  • Corpus ID: 15761839
We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a… 
Highly Cited
2000
Highly Cited
2000
IP multicast offers the scalable point-to-multipoint delivery necessary for using group communication applications on the… 
Highly Cited
1999
Highly Cited
1999
I was quietly lurking in the background of a CHI-Web discussion, when I lost all reason: I just couldn't take it anymore. " I put… 
Review
1958
Review
1958
  • C. Elton
  • Springer US
  • 1958
  • Corpus ID: 28041102
It is difficult to review reprints of the classical titles. Even more so, to review a book written by somebody about whom the…