Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site ucbvax.BERKELEY.EDU
Path: utzoo!decvax!bellcore!ulysses!ucbvax!C.CS.CMU.EDU!KRULWICH
From: KRULWICH@C.CS.CMU.EDU (Bruce Krulwich)
Newsgroups: mod.ai
Subject: connectionism/complexity theory
Message-ID: <8606120642.AA05427@ucbvax.Berkeley.EDU>
Date: Mon, 9-Jun-86 17:35:00 EDT
Article-I.D.: ucbvax.8606120642.AA05427
Posted: Mon Jun  9 17:35:00 1986
Date-Received: Thu, 12-Jun-86 19:17:13 EDT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 15
Approved: ailist@sri-ai.arpa



June 2nd's issue of Business Week contained an article about
connectionist (parallel distributed processing) models.  In it it
mentioned a Bell Labs project which set up a neural network which solved
the traveling salesman problem aproximately but quickly.  I'm interested
in articles or other information about this project or any other project
linking connectionism with complexity theory, ie, connectionist
approaches to graph problems or models which solve other "classical"
algorithm design problems.

				Bruce Krulwich

				ARPAnet: KRULWICH@C.CS.CMU.EDU
				Bitnet:  BK0A%TC.CC.CMU.EDU@CU20B