From: John K Clark (firstname.lastname@example.org)
Date: Tue Oct 13 2009 - 09:52:55 MDT
> > To expand on this:
> > http://portal.acm.org/citation.cfm?id=1052796.1052798
> > The halting problem *is*, in fact, decidable for finite computers,
> > says that paper.
So let's see, if you have a small memory you can prove that a computer
will halt when it runs out of memory. Wow what a profound result! I can
confidently predict that if you loaded Windows Vista into the original
ENIAC from 1946 that machine will halt too.
John K Clark
-- John K Clark email@example.com -- http://www.fastmail.fm - A no graphics, no pop-ups email service
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:04 MDT