Computability and complexity of Julia sets: a review

• Hiratsuka Kota

  Department of Mathematics, Hokkaido University RIES, Hokkaido University

• Sato Yuzuru

  Department of Mathematics, Hokkaido University RIES, Hokkaido University

• Arai Zin

  Department of Mathematics, Hokkaido University

抄録

Since 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].

収録刊行物

• Nonlinear Theory and Its Applications, IEICE

  Nonlinear Theory and Its Applications, IEICE 5 (4), 410-423, 2014

  一般社団法人 電子情報通信学会

キーワード

• computability
• complexity
• Julia sets
• Turing machines
• complex dynamical systems

詳細情報

• CRID: 1390001205345083648
• NII論文ID: 130004697187
• DOI: 10.1587/nolta.5.410
• ISSN: 21854106
• Web Site: https://www.jstage.jst.go.jp/article/nolta/5/4/5_410/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可