Coding for interactive communication

Let the input to a computation problem be split between two processors connected by a communication link; and let an interactive protocol /spl pi/ be known, by which on any input, the processors can solve the problem using no more than T transmissions of bits between them, provided the channel is noiseless. We study the following question: if in fact there is some noise on the channel, what is the effect upon the number of transmissions needed in order to solve the communication problem reliably?.