12,122
edits
Changes
MyWikiBiz, Author Your Legacy — Friday October 24, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 02:30, 2 March 2009
, 02:30, 2 March 2009→Note 7: markup
|}
|}
In this arrangement, the temporal ordering of states can be reckoned by a kind of ''parallel round-up rule''. Specifically, if <math>(a_k, a_{k+1})\!</math> is any pair of adjacent digits in a state vector <math>(a_0, a_1, \ldots, a_n),\!</math> then the value of <math>a_k\!</math> in the next state is <math>a_k^\prime = a_k + a_{k+1},\!</math> the addition being taken mod 2, of course.
In this arrangement, the temporal ordering of states
can be reckoned by a kind of "parallel round-up rule".
Specifically, if <a_k, a_[k+1]> is any pair of adjacent
digits in a state vector <a_0, a_1, ..., a_n>, then the
value of a_k in the next state is [a_k]' = a_k + a_[k+1],
the addition being taken mod 2, of course.
A more complete discussion of this arrangement is given here:
A more complete discussion of this arrangement is given here:
:* [http://stderr.org/pipermail/inquiry/2003-May/000503.html DLOG D24]
==Note 8==
==Note 8==
