An ordinary differential equation defined by a computable function whose maximal interval of existence is non-computable

نویسندگان

  • Daniel S. Graça
  • Ning Zhong
  • Jorge Buescu
چکیده

Let (α, β) ⊂ R denote the maximal interval of existence of solution for the initial-value problem

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach

In this note we consider the computability of the solution of the initial-value problem for ordinary differential equations with continuous right-hand side. We present algorithms for the computation of the solution using the “thousand monkeys” approach, in which we generate all possible solution tubes, and then check which are valid. In this way, we show that the solution of a differential equa...

متن کامل

Effective Computability of Solutions of Differential Inclusions The Ten Thousand Monkeys Approach

In this paper we consider the computability of the solution of the initialvalue problem for differential inclusions with semicontinuous right-hand side. We present algorithms for the computation of the solution using the “ten thousand monkeys” approach, in which we generate all possible solution tubes, and then check which are valid. In this way, we show that the solution of an upper-semicontin...

متن کامل

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains

In this paper we consider the computational complexity of solving initial-value problems defined with analytic ordinary differential equations (ODEs) over unbounded domains of R and C, under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of definition, provided it satisfies a very generous bound on its growth, and that the...

متن کامل

Formulation of Quantum Theory Using Computable and Non-Computable Real Numbers

It is proposed that in two-state quantum theory, a generic quantum state can be described by a non-computable real number. In terms of this, the criterion for measurement outcome is simply and deterministically defined. A description of the Riemann sphere S is given whose points represent, not complex numbers, but certain divergent bivalent sequences S. It is shown that a complex structure emer...

متن کامل

Some Notes on Fine Computability

A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Walsh analysis. We investigate computability properties of a corresponding Fine representation of the real numbers and we construct a structure which characterizes this representation. Moreover, we introduce a general cla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006