Skip to main content
Article thumbnail
Location of Repository

Computability, noncomputability and undecidability of maximal intervals of IVPs

By D. S. Graça, N. Zhong and J. Buescu


Abstract. Let (α, β) ⊆ R denote the maximal interval of existence of solutions for the initial-value problem { dx = f(t, x), dt x(t0) =x0, where E is an open subset of Rm+1, f is continuous in E and (t0,x0) ∈ E. We show that, under the natural definition of computability from the point of view of applications, there exist initial-value problems with computable f and (t0,x0) whose maximal interval of existence (α, β) is noncomputable. The fact that f may be taken to be analytic shows that this is not a lack of the regularity phenomenon. Moreover, we get upper bounds for the “degree of noncomputability ” by showing that (α, β) is r.e. (recursively enumerable) open under very mild hypotheses. We also show that the problem of determining whether the maximal interval is bounded or unbounded is in general undecidable. 1

Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.