Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!cs.utexas.edu!lgc.com!news
From: cl@lgc.com (Cameron Laird)
Newsgroups: comp.theory
Subject: Re: Real Number Model of Computation
Message-ID: <1991Jan16.153109.17223@lgc.com>
Date: 16 Jan 91 15:31:09 GMT
Sender: news@lgc.com
Organization: Landmark Graphics Corp., Houston, Tx
Lines: 25
In-Reply-To: <1991Jan16.000305.2989@unicorn.cc.wwu.edu>
Nntp-Posting-Host: forest.lgc.com

In article <1991Jan16.000305.2989@unicorn.cc.wwu.edu> you write:
			.
			.
			.
>	Some time ago, but in last 2 years, I recall a mention of
>a theoretical model of computation involving machines that could represent
>and operate on Real Numbers (a uncountable set of symbols anyway).
>Does anyone out in theory land know of references, papers about any
>such models of computation?
			.
			.
			.
'Twas the lead article in the Bulletin of the American Mathematical
Society of approximately June 1989, with co-authors Steven Smales,
someone, and someone.  Smales et al. have published a number of other
versions of these ideas.  I'm likely to bring some of these references
to work in the next week; perhaps I'll post more details.
-- 

Cameron Laird		USA 713-579-4613
cl@lgc.com		USA 713-996-8546 
--

Cameron Laird		USA 713-579-4613
cl@lgc.com		USA 713-996-8546