The complexity of the Structure and Classification of Dynamical Systems

Abstract

This is an expository paper about the Borel complexity of structure and classification theorems. It sorts several classical problems relative to known benchmarks of complexity. As a corollary various problems proposed by people such as von Neumann and Smale are shown to be infeasible using inherently countable information.