Indeterminacy in concurrent computation: Difference between revisions

Content deleted Content added
A limitation of logic programming: "limitation" -> "supposed limitation", since Hewitt and Agha's argument is invalid.
A supposed limitation of logic programming: And by their definitions, sequential programming is not "logical" or "deductive".
Line 12:
Hewitt [1985] and Agha [1991], and other published work argued that mathematical models of concurrency did not determine particular concurrent computations as follows: The Actor model makes use of arbitration (often in the form of notional [[Arbiter (electronics)|Arbiters]]) for determining which message is next in the [[Actor model theory#Arrival orderings|arrival ordering]] of an Actor that is sent multiple messages concurrently. This introduces [[Arbiter (electronics)#Arbiters give rise to indeterminacy|indeterminacy]] in the arrival order. Since the arrival orderings are indeterminate, they cannot be deduced from prior information by mathematical logic alone. Therefore mathematical logic can not implement concurrent computation in open systems.
 
The authors noteclaim that although mathematical logic cannot, in their view, implement general concurrency it can implement some special cases of concurrent computation, ''e.g.,'' sequential computation and some kinds of [[parallel programming|parallel]] computation including the [[lambda calculus]].
 
==Arrival order indeterminacy==