12,080
edits
Changes
Directory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 19:10, 17 March 2009
, 19:10, 17 March 2009→Transition Relations: markup
This complex implication statement can be read to say:
This complex implication statement can be read to say:
<pre>
{| align="center" cellpadding="8" width="90%"
|<math>\operatorname{If}</math>
|-
| At the time <math>p_0,\!</math> the machine <math>M\!</math> is in the state <math>q_0,\!</math> and
|-
| At the time <math>p_0,\!</math> the scanner <math>H\!</math> is reading cell <math>r_1,\!</math> and
|-
| At the time <math>p_0,\!</math> the tape cell <math>r_1\!</math> contains a <math>\texttt{1},</math>
|-
| <math>\operatorname{Then}</math>
|-
| At the time <math>p_1,\!</math> the machine <math>M\!</math> is in the state <math>q_1,\!</math> and
</pre>
|-
| At the time <math>p_1,\!</math> the scanner <math>H\!</math> is reading cell <math>r_2,\!</math> and
|-
| At the time <math>p_1,\!</math> the tape cell <math>r_1\!</math> contains a <math>\texttt{1},</math>
|}
==Note 32==
==Note 32==