- This event has passed.

# Conditional Coding with Limiting Computational Resources

## March 28, 2012 @ 11:00 am

Daniil Musatov (Yandex and Moscow Institute of Physics and Technology)

### Event Navigation

Consider the following situation. Alice knows string x and Bob knows string y. There is a limited capacity information channel from Alice to Bob. Alice wants to transmit a message that is sufficient for Bob to recover x. What is a minimum capacity that allows her to do it? Obviously, there is a theoretical minimum: the amount of information in x that is not contained in y. Astonishing enough, this is a precise estimate: Alice can produce an optimal code even though she does not know what information Bob already possesses. In Shannon entropy framework this fact is stated as Slepian-Wolf theorem. In Kolmogorov complexity framework (where both Alice and Bob use computable functions and logarithmic advice) it was proven by Muchnik. In the talk we will give another proof of Muchnik’s result and extend it to space-bounded case, where Alice and Bob use space-bounded computations and advice is still logarithmic.