Indeterminacy in concurrent computation: Difference between revisions

Revision as of 18:48, 13 January 2013

Revision as of 18:51, 13 January 2013

Line 3:

'''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 [[Multi-core processor|many-core]] computer architectures. These computer systems make use of [[Arbiter (electronics)|arbiters]] which give rise to [[indeterminacy]].<ref>Carl Hewitt [http://what-is-computation.carlhewitt.info ''What is computation? Actor Model versus Turing's Model''] in A Computable Universe: Understanding Computation & Exploring Nature as Computation. Dedicated to the memory of Alan M. Turing on the 100th anniversary of his birth. Edited by Hector Zenil. World Scientific Publishing Company. 2012</ref>

==A limitation of logic programming==

Line 47:

==References==

*[[Carl Hewitt]] [http://what-is-computation.carlhewitt.info ''What is computation? Actor Model versus Turing's Model''] in A Computable Universe: Understanding Computation & Exploring Nature as Computation. Dedicated to the memory of Alan M. Turing on the 100th anniversary of his birth. Edited by Hector Zenil. World Scientific Publishing Company. 2012

*[[Carl Hewitt]]. '''PLANNER: A Language for Proving Theorems in Robots''' [[IJCAI]] 1969.

*Carl Hewitt. '''Procedural Embedding of Knowledge In Planner''' IJCAI 1971.

*Carl Hewitt, Peter Bishop and Richard Steiger. '''A Universal Modular Actor Formalism for Artificial Intelligence''' IJCAI 1973.