1
$\begingroup$

The wikipedia page Actor Model and Process Calculi History, presents the following claim:

The semantics [of CSP] provided bounded nondeterminism unlike the Actor model with unbounded nondeterminism. However, with bounded nondeterminism is [sic] impossible for a server to guarantee service to its clients, i.e., a client might starve.

However, there is no citation provided for the claim. Carl Hewitt makes the same claim in this video, so it's not a mistake by a wikipedia author. Can anyone provide the source (or their own proof) of this assertion?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.