Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!mcsun!ukc!strath-cs!cs.glasgow.ac.uk!dvjm
From: dvjm@cs.glasgow.ac.uk (David Murphy)
Newsgroups: comp.theory
Subject: Re: Real Number Model of Computation
Message-ID: <7446@vanuata.cs.glasgow.ac.uk>
Date: 17 Jan 91 08:37:22 GMT
References: <1991Jan16.153109.17223@lgc.com>
Reply-To: dvjm@cs.glasgow.ac.uk (David Murphy)
Organization: The Kidlington Continuum
Lines: 23

>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?

One thing you might find of interest is
	X machines and the Halting Problem; Building a SuperTuring
	Machine. Mike Stannett, Formal Aspects of Computing, Vol. 2,
	No. 4.

Oh, and there's something wrong with the mailer at your end; it
doesn't recognise the return address it generates ...

D.


-- 
David Murphy,               | JANET: dvjm@cs.glasgow.ac.uk
Dept. of Computing Science, | UUCP:  ..!mcsun!ukc!cs.glasgow.ac.uk!dvjm
University of Glasgow,      | ARPA:  dvjm%cs.glasgow.ac.uk@nsfnet-relay.ac.uk
Glasgow G12 8QQ, SCOTLAND   + Necessity is the mother of strange bedfellows