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 02:20, 18 March 2009
, 02:20, 18 March 2009→State Partition: <math>\operatorname{M}</math>
<br>
<br>
The State Partition segment of the propositional program consists of three universal partition expressions, taken in conjunction expressing the condition that <math>M\!</math> has to be in one and only one of its states at each point in time under consideration. In short, we have the constraint:
The State Partition segment of the propositional program consists of three universal partition expressions, taken in conjunction expressing the condition that <math>\operatorname{M}</math> has to be in one and only one of its states at each point in time under consideration. In short, we have the constraint:
{| align="center" cellpadding="8" width="90%"
{| align="center" cellpadding="8" width="90%"
<p>At each of the points in time <math>p_i,\!</math> for <math>i\!</math> in the set <math>\{ 0, 1, 2 \},\!</math></p>
<p>At each of the points in time <math>p_i,\!</math> for <math>i\!</math> in the set <math>\{ 0, 1, 2 \},\!</math></p>
<p><math>M\!</math> can be in exactly one state <math>q_j,\!</math> for <math>j\!</math> in the set <math>\{ 0, 1, \#, * \}.</math></p>
<p><math>\operatorname{M}</math> can be in exactly one state <math>q_j,\!</math> for <math>j\!</math> in the set <math>\{ 0, 1, \#, * \}.</math></p>
|}
|}
