12,122
edits
Changes
MyWikiBiz, Author Your Legacy — Friday October 24, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 18:56, 17 March 2009
, 18:56, 17 March 2009→Transition Relations: markup
The Transition Relation segment of the propositional program for <math>\operatorname{Stunt}(2)</math> consists of sixteen implication statements with complex antecedents and consequents. Taken together, these give propositional expression to the TM Figure and Table that were given at the outset.
The Transition Relation segment of the propositional program for <math>\operatorname{Stunt}(2)</math> consists of sixteen implication statements with complex antecedents and consequents. Taken together, these give propositional expression to the TM Figure and Table that were given at the outset.
Just by way of a single example, consider the clause:
Just by way of a single example, consider the clause:
{| align="center" cellpadding="8" width="90%"
| <math>\texttt{(~p0\_q0~~p0\_r1~~p0\_r1\_s1~~(~p1\_q1~~p1\_r2~~p1\_r1\_s1~))}</math>
|}
This complex implication statement can be read to say:
This complex implication statement can be read to say:
<pre>
IF:
IF:
