The talk will survey recent results on coding schemes that protect interactive communications against adversarial errors. 

This includes the first computationally efficient coding schemes that achieve positive communication rate whenever the error rate allows for a non-zero capacity. I will also show that using adaptive rate adaptation increase the maximum tolerable error rate from 1/4 to 2/7 and therefore leads to a higher interactive channel capacity. Lastly, I hope to show how these results are intimately connected to list-decodable interactive coding schemes.