LZI - Schloss Dagstuhl - Talks + Materials of Seminar 06051

Collector buttons:

Seminar 06051
Kolmogorov Complexity and Applications

M. Hutter (IDSIA - Lugano, CH), W. Merkle (Univ. Heidelberg, DE), P. Vitanyi (CWI - Amsterdam, NL),

Seminar Wide Materials

Executive Summary of Dagstuhl Seminar 06051: Kolmogorov Complexity and Applications

Abstracts:

DROPS-Submission:

	Upload or overwrite a document file and/or change title of talk


	Due to caching problems of microsofts internet explorer concerning dynamic webpages, sometimes newly uploaded files are not shown. By pressing [CTRL]+[F5], the page is completely reloaded.

Eric Allender , Rutgers Univ. - Piscataway

Open Questions in Kolmogorov Complexity and Computational Complexity

Abstracts:

Klaus Ambos-Spies , Universität Heidelberg

Luis Antunes , Universidade do Porto

Time-Bounded Universal Distributions

Abstracts:

Veronica Becher , University of Buenos Aires

Turing's Unpublished Algorithm for Normal Numbers

Cristian Calude , University of Auckland

Natural Halting Probabilities, Partial Randomness, and Zeta Functions

Abstracts:

Slides:

DROPS-Submission:

Alexey Chernov , IDSIA - Lugano

Complexity Monotone in Conditions and Future Prediction Errors

Abstracts:

Slides:

DROPS-Submission:

Francisco Antonio Doria , Petropolis RJ

Santiago Figueira , University of Buenos Aires

Randomness and Halting Probabilities

Abstracts:

Paper:

Serge Grigorieff , Université Paris VII

From Index Sets to Randomness

Peter Grünwald , CWI - Amsterdam

Inconsistency & Misspecification

Abstracts:

Slides:

Nick Hay , University of Auckland

Error in Enumerable Sequence Prediction

Abstracts:

Slides:

DROPS-Submission:

Denis Hirschfeldt , University of Chicago

Relative Randomness: Interactions between Initial Segment Kolmogorov Complexity and Computability Theory

Slides:

John M. Hitchcock , University of Wyoming

Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws

Abstracts:

Günter Hotz , Universität Saarbrücken

Marcus Hutter , IDSIA - Lugano

On the Convergence of (Non)Universal Semimeasures on Martin-Löf Random Sequences

Abstracts:

Slides:

Yuri Kalnishkan , RHUL - London

Predictive Complexity Overview

Björn Kjos-Hanssen , Univ. Of Connecticut

Google Distance Between Words

Abstracts:

DROPS-Submission:

Wouter Koolen-Wijkstra , CWI - Amsterdam

Michal Koucky , Academy of Sciences - Prague

High-entropy random selection protocols

Antonin Kucera , Charles University - Prague

Shane Legg , IDSIA - Lugano

Is there a simple theory of prediction?

Abstracts:

Slides:

Leonid A. Levin , Boston University

Elvira Mayordomo , University of Zaragoza

Points on Computable Curves

Abstracts:

Slides:

Wolfgang Merkle , Universität Heidelberg

Jochen Messner , Universität Ulm

Joseph S. Miller , Univ. Of Connecticut

Contrasting plain and prefix-free Kolmogorov complexity

Slides:

Philippe Moser , University of Zaragoza

Andrej A. Muchnik , INT - Moscow

Optimal Aggregation of Expert Advices

Jan Poland , Hokkaido Univ. - Sapporo

Recent Results in Universal and Non-Universal Induction

Abstracts:

Slides:

DROPS-Submission:

Jan Reimann , Universität Heidelberg

Rüdiger Reischuk , Universität Lübeck

On String Compression by Context-Free Grammars

Robert Rettinger , FernUniversität in Hagen

Andrej Romashchenko , IITP - Moscow

Stability of Kolmogorov Type Properties under Relativization

Abstracts:

Slides:

Andrei Rumyantsev , Moscow State University

Forbidden substrings, Kolmogorov complexity and almost periodic sequences

Abstracts:

Slides:

Paper:

Boris Ryabko , Russian Academy of Sc. - Novosibirsk

Kolmogorov Complexity and Mathematical Statistics

Abstracts:

DROPS-Submission:

Daniil Ryabko , IDSIA - Lugano

Learning in Reactive Environments with Arbitrary Dependence

Abstracts:

DROPS-Submission:

Jürgen Schmidhuber , IDSIA - Lugano

Proof-Based General Search Algorithms and Goedel Machines

Abstracts:

Claus Peter Schnorr , Universität Frankfurt

Rainer Schuler , Universität Ulm

Uwe Schöning , Universität Ulm

Alexander Shen , IITP - Moscow

Multisource algorithmic information theory

Abstracts:

DROPS-Submission:

Combinatorial proof of Muchnik's theorem

Abstracts:

DROPS-Submission:

Theodore A. Slaman , Univ. California - Berkeley

Relative n-Randomness for Continuous Measures

Abstracts:

Slides:

Ludwig Staiger , Universität Halle-Wittenberg

Self-similar Sets, Dimensions and Kolmogorov Complexity

Abstracts:

Slides:

Sebastiaan Terwijn , TU Wien

On the difference between Martin-L\"of randomness and Schnorr randomness

Abstracts:

Leen Torenvliet , University of Amsterdam

John Tromp , CWI - Amsterdam

Binary Lambda Calculus and Combinatory Logic

Abstracts:

DROPS-Submission:

Vladimir V'Yugin , IITP - Moscow

On Impossibility of Sequential Algorithmic Forecasting

Abstracts:

Slides:

DROPS-Submission:

Nikolai K. Vereshchagin , Moscow State University

Algorithmic rate-distortion theory

Abstracts:

Paper:

Paul M.B. Vitanyi , CWI - Amsterdam

Kolmogorov complexity and Shannon information

Abstracts:

Normalized Compression Distance and Automatic Meaning Discovery Using Google

Abstracts:

DROPS-Submission:

Volodya Vovk , RHUL - London

A dual approach to universal prediction

Abstracts:

Slides:

Marius Zimand , Towson University - Baltimore

Simple extractors from crypto pseudo-random generators

Slides:

Paper:

Simple extractors via constructions of cryptographic pseudo-random

Abstracts:

Slides:

Paper:

Steven de Rooij , CWI - Amsterdam

Algorithmic Rate Distortion in Practice

Copyright

This webpage and the material that is made available on this webpage is licensed under a
Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 Unported License.

The CC by-nc-nd license allows you to copy, distribute and transmit the work under the following conditions:

Attribution: You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
Noncommercial: You may not use this work for commercial purposes.
No Derivative Works: You may not alter, transform, or build upon this work.

Seminar 06051 Kolmogorov Complexity and Applications

Copyright

Seminar 06051
Kolmogorov Complexity and Applications