Parallel Machines

Author: Boucher A.1

Source: Minds and Machines, Volume 7, Number 4, November 1997 , pp. 543-551(9)

Publisher: Springer

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Abstract:

Because it is time-dependent, parallel computation is fundamentally different from sequential computation. Parallel programs are non-deterministic and are not effective procedures. Given the brain operates in parallel, this casts doubt on AI's attempt to make sequential computers intelligent.

Keywords: Parallel; serial; sequential; Turing machine; effective procedure; time-dependent; non-determinism; McCulloch-Pitts neural network; artificial intelligence

Language: English

Document Type: Regular paper

Affiliations: 1: Marc/ota/dai, Dept. of Equity Derivatives, Société Générale, 17 Cours Valmy, 92987 Paris-La Defense Cedex, France.

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$47.00 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A