From: Pavitra (celestialcognition@gmail.com)
Date: Mon Oct 12 2009 - 17:24:15 MDT
Bradley Thomas wrote:
> Isn't any finite algorithm bound to return to the same state eventually?
The algorithm could have a "STOP" instruction that prevents further
evaluation. (On the other hand, you might choose to interpret this as
the "final" state repeating indefinitely. "Are we stopped? Yes, so don't
change anything. Next step: are we stopped? Yes...")
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:04 MDT