12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Wednesday April 09, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 15:00, 15 March 2009
, 15:00, 15 March 2009→Note 24: markup
Line 1,989:
Line 1,989:
<pre>
( p0_q# ( p1_q# ))+ ( p0_q* ( p1_q* ))+ + ( p1_q# ( p2_q# ))+ ( p1_q* ( p2_q* ))+
A complete description of <math>\operatorname{Stunt}(2)</math> in propositional form is obtained by conjoining one of the above choices for initial conditions with all of the following sets of propositions, that serve in effect as a simple type of ''declarative program'', telling us all that we need to know about the anatomy and behavior of the truncated TM in question.
A complete description of <math>\operatorname{Stunt}(2)</math> in propositional form is obtained by conjoining one of the above choices for initial conditions with all of the following sets of propositions, that serve in effect as a simple type of ''declarative program'', telling us all that we need to know about the anatomy and behavior of the truncated TM in question.
−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>
Terminal Conditions:
Terminal Conditions:
