Computability in Europe 2006
Logical Approaches to Computational Barriers
|Slot:||Tue, 10:50-11:10, Faraday J (col. 5)|
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||
Warning: date(): It is not safe to rely on the system's timezone settings. You are *required* to use the date.timezone setting or the date_default_timezone_set() function. In case you used any of those methods and you are still getting this warning, you most likely misspelled the timezone identifier. We selected the timezone 'UTC' for now, but please set date.timezone to select your timezone. in /srv/www/htdocs-cs/cie06/conf-code.php on line 135