From: Stuart Armstrong (firstname.lastname@example.org)
Date: Wed Oct 14 2009 - 03:37:07 MDT
> The *turing machine* doesn't return to the same state, but the
> *algorithm* only has (I think) 3 states, so the algorithm returns to
> the same state routinely. Same with the Pi example. Program !=
Agreed. But since we got talking about infinite loops, I interpreted
"the same state" as meaning part of a cyclic repetition, in which case
the data is relevant.
> The only way you can get a machine running deterministicaly that
> never returns to exactly the same state and never halts is if the
> program is infinite, or the data is infinite; the latter is the case
> of your Turing machine. On real computers, this isn't possible. So
> in fact what the person Stuart was replying to is correct, if you
> require both the FSM and the data to be finite.
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:05 MDT