2023-03-26T06:34:43Zhttps://eprints.lib.hokudai.ac.jp/dspace-oai/requestoai:eprints.lib.hokudai.ac.jp:2115/698582022-11-17T02:08:08Zhdl_2115_45007hdl_2115_116Computability and complexity of Julia sets: a reviewHiratsuka, KotaSato, YuzuruArai, Zin410Since A. M. Turing introduced the notion of computability in 1936, various theories of real number computation have been studied [1][10][13]. Some are of interest in nonlinear and statistical physics while others are extensions of the mathematical theory of computation. In this review paper, we introduce a recently developed computability theory for Julia sets in complex dynamical systems by Braverman and Yampolsky [3].Department of Mathematics, Hokkaido UniversityDepartmental Bulletin Paperapplication/pdfhttp://hdl.handle.net/2115/69858info:doi/10.14943/84198https://eprints.lib.hokudai.ac.jp/dspace/bitstream/2115/69858/1/pre1054.pdfHokkaido University Preprint Series in Mathematics10541202014-04-30engpublisher