12,089
edits
Changes
Directory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 20:31, 10 March 2009
, 20:31, 10 March 2009→Note 17: markup
so on until there is nothing left to analyze any further.
so on until there is nothing left to analyze any further.
As a general rule, one proceeds by way of the following stages:
As a general rule, one proceeds by way of the following stages:
1. EF = [d^0]F + [r^0]F
{| align="center" cellpadding="8" width="90%"
|
2. [r^0]F = [d^1]F + [r^1]F
<math>\begin{array}{lccccc}
1. & \operatorname{E}F & = & \operatorname{d}^0 F & + & \operatorname{r}^0 F
3. [r^1]F = [d^2]F + [r^2]F
\\
2. & \operatorname{r}^0 F & = & \operatorname{d}^1 F & + & \operatorname{r}^1 F
4. ...
\\
3. & \operatorname{r}^1 F & = & \operatorname{d}^2 F & + & \operatorname{r}^2 F
\\
4. & \ldots
\end{array}</math>
|}
<pre>
In our analysis of the current transformation F,
In our analysis of the current transformation F,
we carried out Step 1 in the more familiar form
we carried out Step 1 in the more familiar form