J. L. Balcc-azar, J. Dii, and J. Gabarrr, Structural Complexity I. E A TCS Monographs on Theoretical Computer Science, 1988.

L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers : NP-completeness, recursive functions and universal machines, Bulletin of the American Mathematical Society, vol.21, issue.1, pp.1-46, 1989.

M. Cosnard, M. Garzon, and P. Koiran, Computability properties of lowdimensional dynamical systems, Proceedings of the Symposium on Theoretical Aspects of Computer Science

M. Cosnard and P. Koiran, Relations between models of parallel abstract machines, Proceedings of the Heinz Nixdorf seminar, 1992.

C. Cucker and F. , On the complexity of some problems for the Blum, Shub & Smale model, Proceedings of Latin'92, n umber 583 in Lecture Notes in Computer Science, pp.117-129, 1992.

-. Ker and . Ko, Complexity Theory of Real Functions. Birkhh auser, 1991.

H. T. Siegelmann and E. D. Sontag, Neural networks with real weights: analog computational complexity, 1992.

H. T. Siegelmann and E. D. Sontag, On the computational power of neural nets, Proc. Fifth ACM Workshop on Computational Learning Theory, 1992.

, Handbook of Theoretical Computer Science, 1990.