Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!usc!apple!uokmax!munnari.oz.au!goanna!ok
From: ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe)
Newsgroups: comp.lang.misc
Subject: Re: Turing equivalence (was first-class composable functions)
Keywords: infinite tape, sophistry
Message-ID: <4800@goanna.cs.rmit.oz.au>
Date: 20 Feb 91 06:54:38 GMT
References: <1991Feb7.150537.9257@spool.cs.wisc.edu> <11077@pasteur.Berkeley.EDU>
Organization: Comp Sci, RMIT, Melbourne, Australia
Lines: 11

In article <11077@pasteur.Berkeley.EDU>, boyland@aspen.Berkeley.EDU (John B. Boyland) writes:
...
> funding is dropped, or whatever), but assuming the current model of Big Crunch,
> where the universe has a limited "lifetime", it is theoretically possible to
> build a Turing machine which never runs out of tape.

What current model of "Big Crunch"?  Unless there has been a breakthrough
in the last couple of days, the Missing Matter is still missing, and the
best guess is still an open universe.
-- 
Professional programming is paranoid programming