From: J. Andrew Rogers (firstname.lastname@example.org)
Date: Thu May 20 2004 - 11:31:57 MDT
John K Clark wrote:
> If you say the machine must absolutely positively do X, no
> exceptions, sooner or later it will find itself in a situation where
> doing X is imposable, and then your machine will go into an infinite
This doesn't makes sense, and seems to follow from faulty assumptions.
For example, there are all sorts of universal computer designs that are
incapable of expressing an infinite loop. Some universal computational
models will always halt on a finite state machinery, being only capable
of approximating computations that would not halt on a true UTM.
j. andrew rogers
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:00:46 MDT