12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Wednesday November 20, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 19:06, 13 March 2009
, 19:06, 13 March 2009→Note 21: spacing
A turing machine for computing the parity of a bit string is described by means of the following Figure and Table.
A turing machine for computing the parity of a bit string is described by means of the following Figure and Table.
<br>
<pre>
<pre>
o-------o--------o-------------o---------o------------o
o-------o--------o-------------o---------o------------o
</pre>
</pre>
<br>
The TM has a ''finite automaton'' (FA) as one component. Let us refer to this particular FA by the name of <math>\operatorname{M}.</math>
The TM has a ''finite automaton'' (FA) as one component. Let us refer to this particular FA by the name of <math>\operatorname{M}.</math>
