A program which eventually stops but does not halt “too quickly” halts at a time which is algorithmically compressible. This result — originally proved in [4] — is proved in a more general setting. Following Manin [11] we convert the result into an anytime algorithm for the halting problem and we show that the stopping time (cut-off temporal bound) cannot be significantly improved
A control system operating in a complex environment will encounter a variety of different situations...
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of all...
Anytime algorithms give intelligent real-time systems the ability to trade deliberation time for qua...
A program which eventually stops but does not halt “too quickly” halts at a time which is algorithmi...
In this paper we analyze the notion of "stopping time complexity", the amount of information needed ...
AbstractAnytime algorithms offer a tradeoff between solution quality and computation time that has p...
AbstractThe aim of this paper is to provide a probabilistic, but non-quantum, analysis of the Haltin...
In this paper we study a variant of the Kolmogorov complexity for non-effective computations, that i...
AbstractA RAM program is said to run within a “strong” time bound T if on every sequence of n inputs...
Un des aspects les plus contraignants pour l'implantation d'applications temps-reel est que beaucoup...
AbstractA resource-bounded version of the statement “no algorithm recognizes all non-halting Turing ...
AbstractFor each time bound T: {input strings} → {natural numbers} that is some machine's exact runn...
International audienceA Branch-and-Prune algorithm computes a paving of the solution set of a numeri...
The complexity of reasoning in intelligent systems makes it undesirable, and sometimes infeasible, t...
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of all...
A control system operating in a complex environment will encounter a variety of different situations...
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of all...
Anytime algorithms give intelligent real-time systems the ability to trade deliberation time for qua...
A program which eventually stops but does not halt “too quickly” halts at a time which is algorithmi...
In this paper we analyze the notion of "stopping time complexity", the amount of information needed ...
AbstractAnytime algorithms offer a tradeoff between solution quality and computation time that has p...
AbstractThe aim of this paper is to provide a probabilistic, but non-quantum, analysis of the Haltin...
In this paper we study a variant of the Kolmogorov complexity for non-effective computations, that i...
AbstractA RAM program is said to run within a “strong” time bound T if on every sequence of n inputs...
Un des aspects les plus contraignants pour l'implantation d'applications temps-reel est que beaucoup...
AbstractA resource-bounded version of the statement “no algorithm recognizes all non-halting Turing ...
AbstractFor each time bound T: {input strings} → {natural numbers} that is some machine's exact runn...
International audienceA Branch-and-Prune algorithm computes a paving of the solution set of a numeri...
The complexity of reasoning in intelligent systems makes it undesirable, and sometimes infeasible, t...
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of all...
A control system operating in a complex environment will encounter a variety of different situations...
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of all...
Anytime algorithms give intelligent real-time systems the ability to trade deliberation time for qua...
DOI
Add to ORKG