02144oam 2200409zu 450 991087274400332120241212214841.0(CKB)111026746712762(SSID)ssj0000455415(PQKBManifestationID)12166333(PQKBTitleCode)TC0000455415(PQKBWorkID)10399642(PQKB)11387528(NjHacI)99111026746712762(EXLCZ)9911102674671276220160829d1995 uy engur|||||||||||txtccr1994 IEEE-IMS Workshop on Information Theory and Statistics[Place of publication not identified]IEEE19951 online resourceBibliographic Level Mode of Issuance: Monograph9780780327610 0780327616 The author describes analogous coding theorems for the more general, interactive, communications required in computation. In this case the bits transmitted in the protocol are not known to the processors in advance but are determined dynamically. First he shows that any interactive protocol of length T between two processors connected by a noiseless channel can be simulated, if the channel is noisy (a binary symmetric channel of capacity C), in time proportional to T 1/C, and with error probability exponentially small in T. He then shows that this result can be extended to arbitrary distributed network protocols. He shows that any distributed protocol which runs in time T on a network of degree d having noiseless communication channels, can, if the channels are in fact noisy, be simulated on that network in time proportional to T 1/C log d. The probability of failure of the protocol is exponentially small in T.Information theoryInformation theory.003.54IEEE, Institute of Electrical and Electronics Engineers, Inc. StaffPQKBBOOK99108727440033211994 IEEE-IMS Workshop on Information Theory and Statistics2496226UNINA