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:26, 18 March 2009
, 02:26, 18 March 2009→Register Partition: <math>\operatorname{H}</math>
|}
|}
The Register Partition segment of the propositional program consists of three universal partition expressions, taken in conjunction saying that the read head <math>H\!</math> must be reading one and only one of the registers or tape cells available to it at each of the points in time under consideration. In sum:
The Register Partition segment of the propositional program consists of three universal partition expressions, taken in conjunction saying that the read head <math>\operatorname{H}</math> must be reading one and only one of the registers or tape cells available to it at each of the points in time under consideration. In sum:
{| 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 = 0, 1, 2,\!</math></p>
<p>At each of the points in time <math>p_i,\!</math> for <math>i = 0, 1, 2,\!</math></p>
<p><math>H\!</math> is reading exactly one cell <math>r_j,\!</math> for <math>j = 0, 1, 2.\!</math>
<p><math>\operatorname{H}</math> is reading exactly one cell <math>r_j,\!</math> for <math>j = 0, 1, 2.\!</math>
|}
|}
