Revision as of 16:20, 12 February 2021 edit Rich Farmbrough (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, File movers, IP block exemptions, Pending changes reviewers, Rollbackers, Template editors 1,733,978 edits →History: Copyedit. ← Previous edit		Revision as of 15:12, 9 December 2021 edit undo Citation bot (talk \| contribs) Bots 5,865,649 edits Alter: template type. Add: isbn, pages, date. Upgrade ISBN10 to ISBN13. \| Use this bot. Report bugs. \| Suggested by Abductive \| #UCB_toolbar Next edit →
Line 61: }}</ref> where it is described starting on page 73 in the context of communication between two groups of gangsters. This problem was given the name the ''Two Generals Paradox'' by [[Jim Gray (computer scientist)\|Jim Gray]]<ref>{{cite web\|url=http://research.microsoft.com/~Gray/JimGrayHomePageSummary.htm \|title=Jim Gray Summary Home Page \|publisher=Research.microsoft.com \|date=2004-05-03 \|accessdate=2010-03-19}}</ref> in 1978 in "Notes on Data Base Operating Systems"<ref>{{cite ~~web~~book\|url=http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=723863 \|title=Notes on Data Base Operating Systems \|date=January 1978 \|pages=393–481 \|publisher=Portal.acm.org \|isbn=9783540087557 \|accessdate=2010-03-19}}</ref> starting on page 465. This reference is widely given as a source for the definition of the problem and the impossibility proof, though both were published previously as mentioned above. ==References==

Two Generals' Problem: Difference between revisions