Content deleted Content added
m →Arrival order indeterminacy: <blockquote> |
→A limitation of logic programming: "limitation" -> "supposed limitation", since Hewitt and Agha's argument is invalid. |
||
Line 7:
Computation is an area in which indeterminacy is becoming increasingly important because of the massive increase in concurrency due to networking and the advent of [[Multi-core processor|many-core]] computer architectures. These computer systems make use of [[Arbiter (electronics)|arbiters]] which give rise to [[Nondeterministic algorithm|indeterminacy]].
==A supposed limitation of logic programming==
[[Patrick J. Hayes|Patrick Hayes]] [1973] argued that the "usual sharp distinction that is made between the processes of computation and deduction, is misleading". [[Robert Kowalski]] developed the thesis that ''computation could be subsumed by deduction'' and quoted with approval "Computation is controlled deduction." which he attributed to Hayes in his 1988 paper on the early history of Prolog. Contrary to Kowalski and Hayes, [[Carl Hewitt]] claimed that logical deduction was incapable of carrying out concurrent computation in open systems{{citation needed|date=January 2011}}.
| |||