Re: All is information .

From: Tomaz Kristan (
Date: Sat Aug 28 2004 - 00:35:08 MDT

On Sat, 28 Aug 2004 01:26:53 -0700, Daniel Radetsky <> wrote:

> I don't think running out
> of memory can be considered a halt. A computable function is one that *could* be
> computed by a Turing Machine, and Turing machines don't run out of memory.

There is no ideal Turing machine. The question of what an ideal TM
might, or might not do, is out of this world. A closely related
question with that one in the thread about the infinity, kindly closed
by Eliezer.

This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:00:48 MDT