2005/04/06 by Giorgio Parisi
Physics and Astronomy · #cond-mat.stat-mech
published as The Kolmogorov Legacy in Physics,Lectures Notes in Physics 638,(Springer-Verlag, Berlin 2003)eds. R. Livi and A. Vulpiani · 13 pages
arxiv created 2005/04/06 · arxiv updated 2009/12/01
In this paper I will discuss the properties of the Algorithmic Complexity, presenting the most relevant properties. The related concept of logical depth is also introduced. These properties will be used to study the problem of learning from example, paying a special attention to machine learning. We introduce the propensity of a machine to learn a rule and we use it define the intelligence of a machine.