Talk:Indeterminacy in concurrent computation: Difference between revisions

Content deleted Content added
CarlHewitt (talk | contribs)
Line 29:
 
Please note that this very same issue has already been argued on the talk page to [[metastability in electronics]], which has now been moved to [[arbiter (electronics)]] (that is, see [[Talk:arbiter (electronics)]].) [[User:Linas|linas]] 14:25, 19 October 2005 (UTC)
 
== Further editing needed ==
Some further editing is needed. The introduction doesn't say what indeterminacy is, nor where to find out what it is.
 
The second paragraph is garbled. I'm sorry I don't understand these sentences:
 
:''For example Arbiters can be used in the implementation of the arrival ordering of an Actor which are subject to indeterminacy in the arrival order. Therefore mathematical logic can not implement concurrent computation in open systems because of the impossibility of deducing arrival orderings since they are indeterminate. Note that although mathematical logic cannot implement general concurrency it can implement some special cases of current computation, e.g., sequential computation and some kinds of parallel computation including the lambda calculus.''
 
:*There is something wrong with the first sentence: is it ''Arbiters are subject to indeterminacy'' or ''arrival orderings are subject to indeterminacy'' or ''actors are subject to indeterminacy?''
In the laset two cases, it should say "is subject to".
 
:*''deducing arrival orderings'' --- from what?
 
:Thanks .--[[User:CSTAR|CSTAR]] 02:05, 27 November 2005 (UTC)
 
== Merged in [[Actor model, mathematical logic, and physics]] ==