MyWikiBiz, Author Your Legacy — Tuesday November 19, 2024
Jump to navigationJump to search
270 bytes added
, 19:54, 15 March 2009
Line 2,312: |
Line 2,312: |
| ==Note 28== | | ==Note 28== |
| | | |
− | <pre>
| + | ===Interpretation of the Propositional Program (cont.)=== |
− | Interpretation of the Propositional Program (cont.) | |
| | | |
− | Register Partition: | + | '''Register Partition''' |
| | | |
− | (( p0_r0 ),( p0_r1 ),( p0_r2 ))
| + | {| align="center" cellpadding="8" width="90%" |
− | (( p1_r0 ),( p1_r1 ),( p1_r2 ))
| + | | |
− | (( p2_r0 ),( p2_r1 ),( p2_r2 ))
| + | <math>\begin{array}{l} |
| + | \texttt{((~p0\_r0~),(~p0\_r1~),(~p0\_r2~))} |
| + | \\ |
| + | \texttt{((~p1\_r0~),(~p1\_r1~),(~p1\_r2~))} |
| + | \\ |
| + | \texttt{((~p2\_r0~),(~p2\_r1~),(~p2\_r2~))} |
| + | \end{array}</math> |
| + | |} |
| | | |
− | The Register Partition segment of the propositional program | + | 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: |
− | consists of three universal partition expressions, taken in | |
− | conjunction saying that the read head H 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: | |
| | | |
− | At each of the points in time p_i, for i = 0, 1, 2,
| + | {| align="center" cellpadding="8" width="90%" |
− | H is reading exactly one cell r_j, for j = 0, 1, 2.
| + | | |
− | </pre> | + | <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> |
| + | |} |
| | | |
| ==Note 29== | | ==Note 29== |