Revision as of 00:13, 13 March 2020 edit Guywan (talk \| contribs) Extended confirmed users 1,779 edits →Proof: This problem is about uncertainty of transmission, not distinguishing friend from foe. Tags: Mobile edit Mobile web edit Advanced mobile edit ← Previous edit		Revision as of 07:49, 13 September 2020 edit undo Citation bot (talk \| contribs) Bots 5,865,194 edits Add: s2cid, url. Removed URL that duplicated unique identifier. Removed parameters. Some additions/deletions were actually parameter name changes. \| You can use this bot yourself. Report bugs here. \| Suggested by SemperIocundus \| via #UCB_webform Next edit →
Line 49: ==History== The Two Generals' Problem and its impossibility proof was first published by E. A. Akkoyunlu, K. Ekanadham, and R. V. Huber in 1975 in "Some Constraints and Trade-offs in the Design of Network Communications",<ref>{{cite book\|~~chapter-~~url=http://hydra.infosys.tuwien.ac.at/teaching/courses/AdvancedDistributedSystems/download/1975_Akkoyunlu,%20Ekanadham,%20Huber_Some%20constraints%20and%20tradeoffs%20in%20the%20design%20of%20network%20communications.pdf \|doi=10.1145/800213.806523 \|title=Some constraints and trade-offs in the design of network communications \|pages=67–74 \|publisher=Portal.acm.org \|accessdate=2010-03-19\|~~chapter~~year=~~Some constraints and tradeoffs in the design of network communications~~1975 ~~\|year=1975~~ \|last1=Akkoyunlu \|first1=E. A. Line 59 ⟶ 58: \|last3=Huber \|first3=R. V. \|s2cid=788091 }}</ref> where it is described starting on page 73 in the context of communication between two groups of gangsters.

Two Generals' Problem: Difference between revisions