Computability in Dynamical Systems
arXiv:2311.04119
Abstract
In this paper we present an introduction to the area of computability in dynamical systems. This is a fairly new field which has received quite some attention in recent years. One of the central questions in this area is if relevant dynamical objects can be algorithmically presented by a Turing machine. After providing an overview of the relevant objects we discuss recent results concerning the computability of the entropy for symbolic systems and the computability of Julia sets as well as their Brolin-Lyubich measures.
13 pages, 4 figures