12,122
edits
Changes
Directory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 18:30, 17 March 2009
, 18:30, 17 March 2009→Interaction Conditions: markup
A propositional expression of this form can be read as follows:
A propositional expression of this form can be read as follows:
<pre>
{| align="center" cellpadding="8" width="90%"
|<math>\operatorname{If}</math>
|-
| At the time <math>p_i,\!</math> the tape cell <math>r_j\!</math> bears the mark <math>s_k,\!</math>
|-
| <math>\operatorname{But}</math> it is not the case that:
|-
| At the time <math>p_i,\!</math> the tape head is on the tape cell <math>r_j,\!</math>
|-
| <math>\operatorname{Then}</math>
|-
| At the time <math>p_{i+1},\!</math> the tape cell <math>r_j\!</math> bears the mark <math>s_k.\!</math>
|}
The eighteen clauses of the Interaction Conditions simply impose one such constraint on symbol changes for each combination of the times <math>p_0, p_1,\!</math> registers <math>r_0, r_1, r_2,\!</math> and symbols <math>s_0, s_1, s_\#.\!</math>
The eighteen clauses of the Interaction Conditions simply impose one such constraint on symbol changes for each combination of the times <math>p_0, p_1,\!</math> registers <math>r_0, r_1, r_2,</math> and symbols <math>s_0, s_1, s_\#.\!</math>
===Transition Relations===
===Transition Relations===