Classification complexity of chaotic systems

In this paper, we deal with the classification complexity of continuous (Devaney) chaotic systems in dimensions 0, 1 and using the framework of invariant descriptive set theory.We identify the complexity in dimensions 0 and , while in dimension 1 we get some partial results.More precisely, we prove the topological conjugacy relation of invertible chaotic systems on the Hilbert cube (resp.on all compact metric spaces) has the same complexity as (i.e. is Borel bireducible with) the universal orbit relation induced by a Polish group.As a consequence, this answers a recent question asked by L. Ding.We also prove that the topological conjugacy relation of invertible chaotic systems on the Cantor space has the same complexity as the universal relation induced by the group S .This answers a recent question by M. Foreman.Some non-trivial bounds on the classification complexity of chaotic systems on the interval and on the circle are also obtained.Namely, the lower bound is the Vitali equivalence relation, and the upper bound is the equality of countable sets of reals.This especially implies that the relation is Borel.However, the exact complexity remains unknown.