Indeterminacy in Concurrent Computation

Indeterminacy in Concurrent Computation

List price: US$45.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Indeterminacy in concurrent computation is concerned with the effects of indeterminacy in concurrent computation. 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 many-core computer architectures. These computer systems make use of arbiters which give rise to indeterminacy. Patrick Hayes 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 more

Product details

  • Paperback | 72 pages
  • 152 x 229 x 4mm | 118g
  • Dicho
  • United States
  • English
  • 6136592061
  • 9786136592060