From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rpi!usc!wupost!darwin.sura.net!mojo.eng.umd.edu!mimsy!harwood Thu Dec 26 23:57:32 EST 1991
Article 2313 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rpi!usc!wupost!darwin.sura.net!mojo.eng.umd.edu!mimsy!harwood
>From: harwood@umiacs.umd.edu (David Harwood)
Newsgroups: comp.ai.philosophy
Subject: Re: Turing test, parallel processors, and neural nets
Keywords: Turing test parallel neural nets
Message-ID: <45280@mimsy.umd.edu>
Date: 20 Dec 91 17:29:24 GMT
References: <1991Dec20.061406.1609@news.yale.edu>
Sender: news@mimsy.umd.edu
Organization: UMIACS, University of Maryland, College Park, MD 20742
Lines: 15

In article <1991Dec20.061406.1609@news.yale.edu> Peter Seibel writes:
>A few questions about Turing test and related matters.  I would appreciate
>answers and/or references to the literature:
>
\\\\\\\\\\\
	The literature of computational complexity is enormous: I advise
you to go directly to a C.S. prof specializing in parallel algorithms.
	Briefly, there are all sorts of equivalence results, but in view
of your Subject title, I suggest you ask about your C.S. prof about
parallel probabilistic algorithms (for digital computers). In some
important problems, these can be provably more efficient than other kinds 
of algorithms.
	(I tried to reply by mail, but failed.)




