Talk:Indeterminacy in concurrent computation: Difference between revisions

Revision as of 04:35, 2 December 2005

Revision as of 17:41, 2 December 2005

Line 70:

== Disputed ==

Here we go again. I'm not saying that mathematical logic can predict the outcome of a calculation, because of the indeterminancyindeterminacy, but it ''can'' determine a set of possible computations, and potentially verify that any terminating calculation solves the desired problem. [[User:Arthur Rubin|Arthur Rubin]] | [[User_talk:Arthur_Rubin|(talk)]] 02:37, 2 December 2005 (UTC)

:The article says

Line 77:

:Regards, --[[User:CarlHewitt|Carl Hewitt]] 04:35, 2 December 2005 (UTC)

:: (It looks as if I put the tag in the wrong place. Perhaps the next sentence.) This argument applies to any system with (asynchronous) external inputs, not because of ''indeterminacy'', but because the external inputs are not modeled. As for "implement", see [[Non-deterministic Turing machine]]. [[User:Arthur Rubin|Arthur Rubin]] | [[User_talk:Arthur_Rubin|(talk)]] 17:41, 2 December 2005 (UTC)