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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1947-2018
010020030019472017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Most works in multicellular artificial ontogeny solve the halting problem by arbitrarily limiting the number of iterations of the… (More)
  • table I
  • figure 1
  • table II
  • figure 4
  • figure 5
Is this relevant?
2008
2008
In \cite{NasRemVia05} Nash, Remmel, and Vianu have raised the question whether a logic L_\le, already introduced by Gurevich in… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
Is this relevant?
1998
1998
The halting of universal quantum computers is shown to be incompatible with the constraint of unitarity of the dynamics. The… (More)
Is this relevant?
1994
1994
Deductive synthesis methods derive programs in an incremental manner, and therefore pose a halting problem { when can synthesis… (More)
Is this relevant?
1993
1993
where t (resp. tt) is any (resp. linear) term. Recursivity is well-known to be a crucial and fundamental concept in programming… (More)
Is this relevant?
1993
1993
This paper proposes a codiication of the halting problem of any Turing machine in the form of only one right{linear binary Horn… (More)
Is this relevant?
1987
1987
An algorithm is a set of instructions for solving a problem or class o f problems. The instructions must not require ingenuity or… (More)
Is this relevant?
1984
1984
We describe a proof by a computer program of the unsolvability of the halting problem. The halting problem is posed in a… (More)
Is this relevant?
1968
1968
The uniform halting problem (UH) can be stated as follows: Give a decision procedure which for any given Turing machine (TM) will… (More)
  • figure 2
  • figure 1
  • figure 3
  • table 2
  • figure 8
Is this relevant?