Content deleted Content added
summarise problem in lead, move image to top |
|||
Line 41:
Since the '''nondeterministic''' protocol is '''finite''', it then follows that the protocol represented by the empty tree would solve the problem. Clearly this is not possible. Therefore a '''nondeterministic''' protocol which solves the problem cannot exist.<ref>{{cite book|last1=Kennard|first1=Fredrick|title=Thought Experiments: Popular Thought Experiments in Philosophy, Physics, Ethics, Computer Science & Mathematics|publisher=Lulu.com|isbn=9781329003422|page=346|url=https://books.google.nl/books?id=sX-pCQAAQBAJ|accessdate=15 September 2015}}</ref>
===Proof By Symmetry===
Because the problem is devised in such a way that the defender cannot be distinguished with one of the attackers, for all theoretical purposes the defender acts as one of the attackers but inverts the message of the other attacker. Since no message can distinguish the defender from one of the attackers it is impossible to coordinate. This can be seen by simply removing one attacker and treating the problem as two players that must coordinate but in which one always can thwart any coordination(through error or intent). The only solution to the problem is to be able to distinguish the defender from the attacker which solves the problem trivially.
==Engineering approaches==
| |||