Proceedings of the 2013 International Symposium on Nonlinear Theory and its Applications
2013
Session Number:A1L-B
Session:
Number:2
Computability and Complexity of Julia Sets
Kota Hiratsuka, Yuzuru Sato, Zin Arai,
pp.2-5
Publication Date:
Online ISSN:2188-5079
[1] A. M. Turing, “On computable numbers, with an application to the Entschidungsproblem,” Proceedings of the London Mathematical Society, 2:242, p230-256, (1936).
[2] M. B. Pour-El, J. I. Richards, “Computability in Analysis and Physics,” Springer-Verlag / Berlin, (1989).
[5] K. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, (1991).
[6] L. Blum, F. Cucker, M. Shub and S. Smale, “Complexity and Real Computation”; Springer-Verlag / Berlin, (1998).
[7] M. Braverman, and M. Yampolsky, “Computability of Julia sets,” Springer-Verlag / Berlin, (2009).
[8] J. Milnor, “Dynamics in one complex variable Third Edition”, Princeton University Press, (2006).