Computability in Europe 2006
Logical Approaches to Computational Barriers


Regular Talk:
Scaled Dimension of Individual Strings


Speaker: Maria Lopez-Valdes
Slot: Array, 10:50-11:10, col. 5

Abstract

We define a new discrete version of scaled dimension and we find
connections between the scaled dimension of a string and its
Kolmogorov complexity and predictability. We give a new proof of the
characterization of scaled dimension by Kolmogorov complexity, and
prove a new result about scaled dimension and prediction. 


websites: Arnold Beckmann 2006-04-19