Nonlinear Theory and Its Applications, IEICE
Online ISSN : 2185-4106
ISSN-L : 2185-4106
Special Issue on Recent Progress in Nonlinear Theory and Its Applications
Computability and complexity of Julia sets: a review
Kota Hiratsuka, Yuzuru Sato, Zin Arai
Author information
Keywords: computability, complexity, Julia sets, Turing machines, complex dynamical systems
JOURNAL FREE ACCESS

2014 Volume 5 Issue 4 Pages 410-423

J-STAGE : nolta 7 1 pp.56-56
Details
Download PDF (3750K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract

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

Content from these authors
© 2014 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top