Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!mcsun!unido!fauern!tumuc!guug!ecrc!ecrc!traff
From: traff@ecrc.de (Jesper Larsson Traff)
Newsgroups: comp.theory
Subject: Re: Real Number Model of Computation
Message-ID: <1991Jan21.113253.21903@ecrc.de>
Date: 21 Jan 91 11:32:53 GMT
References: <1991Jan16.153109.17223@lgc.com>
Sender: news@ecrc.de
Reply-To: traff@ecrc.de (Jesper Larsson Traff)
Organization: ecrc
Lines: 17

On the same line, has anybody seen the article by Mike Stannett:
"X-machines and
the Halting Problem" in Formal Aspects of Computing, no. 2, 1990, in which the
author proposes a model of computation that is strictly more powerful than the
Turing-machine. It is shown that there exists a machine-instance that can solve
the halting problem for Turing machines.

The "new" model is a kind of analog computer, therefore a) I'm not sure the
result is new, b) I don't think models of this kind captures the
intuitive notion
of mechanical computation c) the presentation seemed somewhat naive to me.
The author claims that an approximation of the machine proposed can actually be
built. If so, this is of course interesting.

Comments?

Jesper Larsson Traff, ECRC (traff@ecrc.de)