| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 130.12 KB | Adobe PDF |
Orientador(es)
Resumo(s)
Let (®, ¯) ½ R denote the maximal interval of existence of
solution for the initial-value problem
½ dx
dt = f(t, x), f : E ! Rm,E is an open subset of Rm+1
x(t0) = x0, with (t0, x0) 2 E.
We show that (®, ¯) is r.e. (recursively enumerable) open and the solution
x(t) defined on (®, ¯) is computable, provided that (a) f is computable
and effectively locally Lipschitz, and (b) (t0, x0) is a computable point.
We also prove that this result is the best in the sense that, for some
initial-value problems satisfying (a) and (b), their maximal intervals of
existence are non-recursive.
