12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Tuesday November 19, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 19:18, 15 March 2009
, 19:18, 15 March 2009→Note 26: markup
==Note 26==
==Note 26==
===Interpretation of the Propositional Program (cont.)===
Interpretation of the Propositional Program (cont.)
'''Terminal Conditions'''
{| align="center" cellpadding="8" width="90%"
|
<math>\begin{array}{l}
\texttt{((~p2\_q\#~)(~p2\_q*~))}
\end{array}</math>
|}
In cactus syntax, an expression of the form <math>\texttt{((p)(q))}</math> expresses the disjunction <math>p ~\operatorname{or}~ q.</math> The corresponding cactus graph, here just a tree, has the following shape:
<br>
<pre>
o---------------------------------------o
o---------------------------------------o
| |
| |
| ((p) (q)) |
| ((p) (q)) |
o---------------------------------------o
o---------------------------------------o
</pre>
<br>
In effect, the Terminal Conditions state the following:
In effect, the Terminal Conditions state the following:
{| align="center" cellpadding=8" width="90%"
|
</pre>
<p>At time <math>p_2\!</math> machine <math>M\!</math> is in state <math>q_\#,\!</math> or</p>
<p>At time <math>p_2\!</math> machine <math>M\!</math> is in state <math>q_*.\!</math></p>
|}
==Note 27==
==Note 27==
