Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
ISSN 0361 7688, Programming and Computer Software, 2010, Vol. 36, No. 2, pp. 6367. Pleiades Publishing, Ltd., 2010. Original Russian Text S.A. Abramov, 2010, published in Programmirovanie, 2010, Vol. 36, No. 2.
 

Summary: ISSN 0361 7688, Programming and Computer Software, 2010, Vol. 36, No. 2, pp. 63­67. © Pleiades Publishing, Ltd., 2010.
Original Russian Text © S.A. Abramov, 2010, published in Programmirovanie, 2010, Vol. 36, No. 2.
63
1. INTRODUCTION
Currently, many undecidable problems in com
puter algebra and related disciplines have become
known to the researchers. Some of them are related to
ordinary differential equations, especially, algebraic
differential equations of the form f(x, y', y'', ..., y()
) = 0,
where f is a polynomial with the coefficients from the
filed of rational numbers (see, e.g., [1], which is
devoted to algorithmic decidability and undecidability
of differential equations of this kind and, in addition to
original results, contains an introductory survey of
publications on this subject). Linear differential equa
tions with polynomial coefficients are a special case of
algebraic differential equations, and many problems
related to them seem simpler than those for general
algebraic­differential equations. Nevertheless, there

  

Source: Abramov, Sergei A. - Dorodnicyn Computing Centre of the Russian Academy of Sciences

 

Collections: Mathematics; Computer Technologies and Information Sciences