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:14, 15 March 2009
, 18:14, 15 March 2009→Note 25: markup
==Note 25==
==Note 25==
===Interpretation of the Propositional Program===
Interpretation of the Propositional Program
Let us now run through the propositional specification of Stunt(2),
Let us now run through the propositional specification of <math>\operatorname{Stunt}(2),</math> our truncated TM, and paraphrase what it says in ordinary language.
our truncated TM, and paraphrase what it says in ordinary language.
Mediate Conditions:
'''Mediate Conditions'''
{| align="center" cellpadding="8" width="90%"
|
<math>\begin{array}{l}
\texttt{(~p0\_q\#~(~p1\_q\#~))}
\\
\texttt{(~p0\_q*~(~p1\_q*~))}
\\ \\
\texttt{(~p1\_q\#~(~p2\_q\#~))}
\\
\texttt{(~p1\_q*~(~p2\_q*~))}
\end{array}</math>
|}
<pre>
In the interpretation of the cactus language for propositional logic
In the interpretation of the cactus language for propositional logic
that we are using here, an expression of the form "(p (q))" expresses
that we are using here, an expression of the form "(p (q))" expresses
