Before discussing the specific question, I think it is worth attending to whpearson’s distinction between algorithms and fetch-execute cycles. A traditional Turing machine implements an algorithm beginning with an initial condition and proceeding to a final condition; the more general interaction machines can accept inputs during their operation which cause branching effects.
Before discussing the specific question, I think it is worth attending to whpearson’s distinction between algorithms and fetch-execute cycles. A traditional Turing machine implements an algorithm beginning with an initial condition and proceeding to a final condition; the more general interaction machines can accept inputs during their operation which cause branching effects.