On 10/3/21 at 10:50 PM, wsjt-devel@lists.sourceforge.net (Alex
via wsjt-devel) wrote:
Even though I had let go of this rule, I think I will reinstate
it again. No 73, no QSO. I really don't care if that means my
log will be a few Q's short. The world is already rude enough
as it is. We can take a few moments to be courteous.
You must realize that no number of messages can ensure that both
ends are ready to log the QSO. It is an example of the Two
Generals' Problem*. For DXing, if you received the necessary
exchange data (usually a call sign and a signal report), then
log the QSO and LotW work it out. For contesting where, if one
side logs the QSO and the other does not, the side making the
log entry loses points agreement is more important. Examination
of logs by contest organizers shows many more cases where points
are lost due to mismatching log entries in FTx contests than in
CW, voice, or RTTY contests. So, in contests log the entry when
the contest rules say you should.
73 Bill AE6JV
* The Two Generals' Problem (from
<https://en.wikipedia.org/wiki/Two_Generals%27_Problem>)
In computing, the Two Generals' Problem is a thought experiment
meant to illustrate the pitfalls and design challenges of
attempting to coordinate an action by communicating over an
unreliable link. In the experiment, two generals are only able
to communicate with one another by sending a messenger through
enemy territory. The experiment asks how they might reach an
agreement on the time to launch an attack, while knowing that
any messenger they send could be captured.
t is related to the more general Byzantine Generals Problem and
appears often in introductory classes about computer networking
(particularly with regard to the Transmission Control Protocol,
where it shows that TCP can't guarantee state consistency
between endpoints and why this is the case), though it applies
to any type of two-party communication where failures of
communication are possible. A key concept in epistemic logic,
this problem highlights the importance of common knowledge. Some
authors also refer to this as the Two Generals' Paradox, the Two
Armies Problem, or the Coordinated Attack Problem.[1][2] The Two
Generals' Problem was the first computer communication problem
to be proved to be unsolvable. An important consequence of this
proof is that generalizations like the Byzantine Generals
problem are also unsolvable in the face of arbitrary
communication failures, thus providing a base of realistic
expectations for any distributed consistency protocols.
--------------------------------------------------------------
Bill Frantz | There are now so many exceptions to the
408-348-7900 | Fourth Amendment that it operates only by
www.pwpconsult.com | accident. - William Hugh Murray
_______________________________________________
wsjt-devel mailing list
wsjt-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/wsjt-devel
