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 18:56, 15 March 2009
, 18:56, 15 March 2009→Interpretation of the Propositional Program: markup
A text string expression of the form <math>\texttt{(p(q))}</math> corresponds to a graph-theoretic data-structure of the following form:
A text string expression of the form <math>\texttt{(p(q))}</math> corresponds to a graph-theoretic data-structure of the following form:
<br>
<pre>
<pre>
o---------------------------------------o
o---------------------------------------o
</pre>
</pre>
<br>
Taken together, the Mediate Conditions state the following:
Taken together, the Mediate Conditions state the following:
<pre>
{| align="center" cellpadding=8" width="90%"
|
<p>If <math>M\!</math> at <math>p_0\!</math> is in state <math>q_\#,\!</math> then <math>M\!</math> at <math>p_1\!</math> is in state <math>q_\#,\!</math> and</p>
<p>If <math>M\!</math> at <math>p_0\!</math> is in state <math>q_*,\!</math> then <math>M\!</math> at <math>p_1\!</math> is in state <math>q_*,\!</math> and</p>
</pre>
<p>If <math>M\!</math> at <math>p_1\!</math> is in state <math>q_\#,\!</math> then <math>M\!</math> at <math>p_2\!</math> is in state <math>q_\#,\!</math> and</p>
<p>If <math>M\!</math> at <math>p_1\!</math> is in state <math>q_*,\!</math> then <math>M\!</math> at <math>p_2\!</math> is in state <math>q_*.\!</math></p>
|}
==Note 26==
==Note 26==
