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
The Vi Tree Planting Foundation in Sweden, generally known as Vi Skogen (ViS), is a well-documented case of an NGO that started… 
2008
2008
A 12.5 T superconducting dipole magnet (European DIPOle, EDIPO) has been designed by EFDA and it is now being procured within the… 
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… 
2003
2003
Global fisheries are in a crisis, and so are the marine ecosystems upon which these fisheries depend. Major policy and management… 
1997
1997
Acknowledgements - Abbreviations - Introduction - Conservative Attitudes to European Integration - The Conservative Party and… 
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… 
1980
1980
In the Netherlands the average production of sewage is appr. 50 m' per PE (population equivalent) per year, containing appr. 1 kg…