Representation Theorems for Analytic Machines and Computability of Analytic Functions

We present results concerning analytic machines, a model of real computation introduced by Hotz which extends the well-known Blum, Shub and Smale machines (BSS machines) by infinite converging computations. The well-known representation theorem for BSS machines elucidates the structure of the functions computable in the BSS model: the domain of such a function partitions into countably many semi-algebraic sets, and on each of those sets the function is a polynomial resp. rational function. In this paper, we study whether the representation theorem can, in the univariate case, be extended to analytic machines, i.e. whether functions computable by analytic machines can be represented by power series in some part of their domain. We show that this question can be answered in the negative over the real numbers but positive under certain restrictions for functions over the complex numbers. We then use the machine model to define computability of univariate complex analytic (i.e. holomorphic) functions and examine in particular the class of analytic functions which have analytically computable power series expansions. We show that this class is closed under the basic analytic operations composition, local inversion and analytic continuation.