MINIMAL AND STRANGE ATTRACTORS
A general concept going back to Kolmogorov claims that if a dynamical system has a complicated attracting set then its behavior has not a deterministic, but rather probabilistic character. This concept was not formalized up to now. Even the definition of attractor has a lot of different versions. This paper presents an attempt to give some definitions and results formalizing this heuristic ideas. It contains a definition of a minimal attractor, modifying the one given in Ilyashenko [1991]. The actual minimality of the attractor is discussed. The principal result is the Triple Choice Theorem. It claims that the existence of a strange minimal attractor implies some mild form of chaos for the map itself or for a nearby one. The program of further investigation is proposed as a chain of problems at the end of the paper.