In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whetherâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Alexandre Devert, Nicolas BredÃ¨che, Marc Schoenauer
- IEEE Transactions on Evolutionary Computation
- 2011

Most works in multicellular artificial ontogeny solve the halting problem by arbitrarily limiting the number of iterations of theâ€¦Â (More)

Is this relevant?

2008

2008

- Yijia Chen, JÃ¶rg Flum
- 2009 24th Annual IEEE Symposium on Logic Inâ€¦
- 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

- Author E. L. Kaplan, Paul Meier
- 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

- Tien D. Kieu
- 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

- Kung-Kiu Lau, Mario Ornaghi, Sten-Ã…ke TÃ¤rnlund
- ICLP
- 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

- Philippe Devienne, Patrick Leb
- 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

- Luke Burkholder
- SIGA
- 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

- Robert S. Boyer, J. Strother Moore
- J. ACM
- 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

- Gabor T. Herman
- SWAT
- 1968

The uniform halting problem (UH) can be stated as follows: Give a decision procedure which for any given Turing machine (TM) willâ€¦Â (More)

Is this relevant?