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
2011
Highly Cited
2011
The communication in Mobile Ad hoc Network (MANET) is multi-hop in nature wherein each node relays data packets of other nodes… 
2008
2008
The Vi Tree Planting Foundation in Sweden, generally known as Vi Skogen (ViS), is a well-documented case of an NGO that started… 
Review
2008
Review
2008
Biodiversity now is considered a highly valuable material, providing manifold services of high importance for the well-being of… 
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… 
Review
2004
Review
2004
Trout are often stocked into alpine lakes based on the generally untested assumption that resident populations would go extinct… 
2003
2003
Global fisheries are in a crisis, and so are the marine ecosystems upon which these fisheries depend. Major policy and management… 
1996
1996
Many new domains for genetic programming require evolved programs to be executed for longer amounts of time. For these… 
1995
1995
Recent proposals, particularly those emanating from Thabo Mbeki, to privatise state corporations in order to finance the… 
1992
1992
Systeins of set consiraznts are a natural formalzsnr for many problems an program analysas. Se2 consiraiiris arc also a…