Аннотация:Infinite power series may appear as inputs for certain mathematical
problems. This paper examines two possible solutions to the
problem of representation of infinite power series: the algorithmic representation
(for each series, an algorithm is specified that, given an
integer i, finds the coefficient of x^i, — any such algorithm defines a
so called computable, or constructive, series) and a representation in an
approximate form, namely, in a truncated form.