Differential Analytic Turing Automata
The task ahead is to chart a course from general ideas about transformational equivalence classes of graphs to a notion of differential analytic turing automata (DATA). It may be a while before we get within sight of that goal, but it will provide a better measure of motivation to name the thread after the envisioned end rather than the more homely starting place.
The basic idea is as follows. One is given a set \(\mathcal{G}\) of graphs and a set \(\mathcal{T}\) of transformations rules \(\operatorname{t} \in \mathcal{T},\) each of which has the effect of taking graphs into graphs, \(\operatorname{t} : \mathcal{G} \to \mathcal{G}.\) In the cases that we shall be studying, this set of transformation rules partitions the set of graphs into transformational equivalence classes (TECs).
There are many interesting excursions to be had here, but I will focus mainly on logical applications, and and so the TECs I talk about will almost always have the character of logical equivalence classes (LECs).
An example that will figure heavily in the sequel is given by rooted trees as the species of graphs and a pair of equational transformation rules that derive from the graphical calculi of C.S. Peirce, as revived and extended by George Spencer Brown.
Here are the fundamental transformation rules, also referred to as the arithmetic axioms, more precisely, the arithmetic initials.
 |
(1) |
 |
(2) |
That should be enough to get started.
Cactus Language
I will be making use of the cactus language extension of Peirce's Alpha Graphs, so called because it uses a species of graphs that are usually called "cacti" in graph theory. The last exposition of the cactus syntax that I've written can be found here:
The representational and computational efficiency of the cactus language for the tasks that are usually associated with boolean algebra and propositional calculus makes it possible to entertain a further extension, to what we may call differential logic, because it develops this basic level of logic in the same way that differential calculus augments analytic geometry to handle change and diversity. There are several different introductions to differential logic that I have written and distributed across the Internet. You might start with the following couple of treatments:
I will draw on those previously advertised resources of notation and theory as needed, but right now I sense the need for some concrete examples.
Example 1
Let's say we have a system that is known by the name of its state space \(X\!\) and we have a boolean state variable \(x : X \to \mathbb{B},\) where \(\mathbb{B} = \{ 0, 1 \}.\)
We observe \(X\!\) for a while, relative to a discrete time frame, and we write down the following sequence of values for \(x.\!\)
|
\(\begin{array}{cc} t & x \\ \\ 0 & 0 \\ 1 & 1 \\ 2 & 0 \\ 3 & 1 \\ 4 & 0 \\ 5 & 1 \\ 6 & 0 \\ 7 & 1 \\ 8 & 0 \\ 9 & \ldots \end{array}\) |
"Aha!" we say, and think we see the way of things, writing down the rule \(\texttt{x}^\prime = \texttt{(x)}\) where \(\texttt{x}^\prime\) is the next state after \(\texttt{x},\) and \(\texttt{(x)}\) is the negation of \(\texttt{x}\) in boolean logic.
Another way to detect patterns is to write out a table of finite differences. For this example, we would get:
|
\(\begin{array}{ccccc} t & x & dx & d^2 x & \ldots \\ \\ 0 & 0 & 1 & 0 & \ldots \\ 1 & 1 & 1 & 0 & \\ 2 & 0 & 1 & 0 & \\ 3 & 1 & 1 & 0 & \\ 4 & 0 & 1 & 0 & \\ 5 & 1 & 1 & 0 & \\ 6 & 0 & 1 & 0 & \\ 7 & 1 & 1 & 0 & \\ 8 & 0 & 1 & \ldots & \\ 9 & \ldots & \ldots & \ldots & \\ \end{array}\) |
And of course, all the higher order differences are zero.
This leads to thinking of \(X\!\) as having an extended state \((x, dx, d^2 x, \ldots, d^k x),\) and this additional language gives us the facility of describing state transitions in terms of the various orders of differences. For example, the rule \(\texttt{x}^\prime = \texttt{(x)}\) can now be expressed by the rule \(\texttt{dx} = \texttt{1}.\)
There is a more detailed account of differential logic in the following paper:
For future reference, here are a couple of handy rosetta stones for translating back and forth between different notations for the boolean functions \(f : \mathbb{B}^k \to \mathbb{B},\) where \(k = 1, 2.\!\)
Example 2
For a slightly more interesting example, let's suppose that we have a dynamic system that is known by its state space \(X,\!\) and we have a boolean state variable \(x : X \to \mathbb{B}.\) In addition, we are given an initial condition \(\texttt{x~=~dx}\) and a law \(\begin{matrix}\texttt{d}^\texttt{2}\texttt{x~=~(x)}.\end{matrix}\)
The initial condition has two cases:
|
\(\begin{array}{ll} 1. & \texttt{x~=~dx~=~0} \\ 2. & \texttt{x~=~dx~=~1} \end{array}\) |
Here is a table of the two trajectories or orbits that we get by starting from each of the two permissible initial states and staying within the constraints of the dynamic law \(\begin{matrix}\texttt{d}^\texttt{2}\texttt{x~=~(x)}.\end{matrix}\)
| \(\text{Initial State}\ x \cdot dx\) |
|
\(\begin{array}{cccc} t & d^0 x & d^1 x & d^2 x \\ \\ 0 & 1 & 1 & 0 \\ 1 & 0 & 1 & 1 \\ 2 & 1 & 0 & 0 \\ 3 & 1 & 0 & 0 \\ 4 & 1 & 0 & 0 \\ 5 & '' & '' & '' \\ \end{array}\) |
| \(\text{Initial State}\ (x) \cdot (dx)\) |
|
\(\begin{array}{cccc} t & d^0 x & d^1 x & d^2 x \\ \\ 0 & 0 & 0 & 1 \\ 1 & 0 & 1 & 1 \\ 2 & 1 & 0 & 0 \\ 3 & 1 & 0 & 0 \\ 4 & 1 & 0 & 0 \\ 5 & '' & '' & '' \\ \end{array}\) |
Note that the state \(\begin{matrix}\texttt{x (dx)(d}^\texttt{2}\texttt{x)},\end{matrix}\) that is, \(\begin{matrix}(\texttt{x}, \texttt{dx}, \texttt{d}^\texttt{2}\texttt{x}) ~=~ (1, 0, 0),\end{matrix}\) is a stable attractor for both orbits.
Further discussion of this example, complete with charts and graphs, can be found at this location:
Example 3
One more example may serve to suggest just how much dynamic complexity can be built on a universe of discourse that has but a single logical feature at its base.
But first, let me introduce a few more elements of general notation that I'll be using to describe finite dimensional universes of discourse and the qualitative dynamics that we envision occurring in them.
Let \(\mathcal{X} = \{ x_1, \ldots, x_n \}\) be the alphabet of logical features or variables that we use to describe the n-dimensional universe of discourse \(X^\circ = [\mathcal{X}] = [ x_1, \ldots, x_n ].\) Picturesquely viewed, one may think of a venn diagram with n overlapping "circles" that are labeled with the feature names in the set \(\mathcal{X}.\) Staying with this picture, one visualizes the universe of discourse \(X^\circ = [\mathcal{X}]\) as having two layers: (1) the set \(X = \langle \mathcal{X} \rangle = \langle x_1, \dots, x_n \rangle\) of points or cells — in another sense of the word than when we speak of cellular automata — (2) the set \(X^\uparrow = (X \to \mathbb{B})\) of propositions, boolean-valued functions, or maps from \(X\!\) to \(\mathbb{B}.\)
Thus, we may speak of the universe of discourse \(X^\circ\) as being an ordered pair \((X, X^\uparrow),\) with \(2^n\!\) points in the underlying space \(X\!\) and \(2^{2^n}\) propositions in the function space \(X^\uparrow.\)
A more complete discussion of these notations can be found here:
Now, to the Example.
Once again, let us begin with a 1-feature alphabet \(\mathcal{X} = \{ x_1 \} = \{ x \}.\) In the discussion that follows I will consider a class of trajectories that are ruled by the constraint that \(d^k x = 0\!\) for all \(k\!\) greater than some fixed \(m,\!\) and I will indulge in the use of some picturesque speech to describes salient classes of such curves. Given this finite order condition, there is a highest order non-zero difference \(d^m x\!\) that is exhibited at each point in the course of any determinate trajectory. Relative to any point of the corresponding orbit or curve, let us call this highest order differential feature \(d^m x\!\) the drive at that point. Curves of constant drive \(d^m x\!\) are then referred to as \(m^\text{th}\!\) gear curves.
One additional piece of notation will be needed here. Starting from the base alphabet \(\mathcal{X} = \{ x \},\) we define and notate \(\operatorname{E}^j \mathcal{X} = \{ x, d^1 x, d^2 x, \ldots, d^j x \}\) as the \(j^\text{th}\!\) order extended alphabet over \(\mathcal{X}.\)
Let us now consider the family of \(4^\text{th}\!\) gear curves through the extended space \(\operatorname{E}^4 X = \langle x, dx, d^2 x, d^3 x, d^4 x \rangle.\) These are the trajectories that are generated subject to the law \(d^4 x = 1,\!\) where it is understood in making such a statement that all higher order differences are equal to \(0.\!\)
Since \(d^4 x\!\) and all higher order \(d^j x\!\) are fixed, the entire dynamics can be plotted in the extended space \(\operatorname{E}^3 X = \langle x, dx, d^2 x, d^3 x \rangle.\) Thus, there is just enough room in a planar venn diagram to plot both orbits and to show how they partition the points of \(\operatorname{E}^3 X.\) As it turns out, there are exactly two possible orbits, of eight points each, as illustrated in Figures 16-a and 16-b. See here:
Here are the \(4^\text{th}\!\) gear curves over the 1-feature universe \(X = \langle x \rangle\) arranged in the form of tabular arrays, listing the extended state vectors \((x, dx, d^2 x, d^3 x, d^4 x)\!\) as they occur in one cyclic period of each orbit.
| \(\text{Orbit 1}\!\) |
| \(\begin{array}{c|ccccc} t & d^0 x & d^1 x & d^2 x & d^3 x & d^4 \\ \\ 0 & 0 & 0 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 & 1 & 1 \\ 2 & 0 & 0 & 1 & 0 & 1 \\ 3 & 0 & 1 & 1 & 1 & 1 \\ 4 & 1 & 0 & 0 & 0 & 1 \\ 5 & 1 & 0 & 0 & 1 & 1 \\ 6 & 1 & 0 & 1 & 0 & 1 \\ 7 & 1 & 1 & 1 & 1 & 1 \\ \end{array}\) |
| \(\text{Orbit 2}\!\) |
| \(\begin{array}{c|ccccc} t & d^0 x & d^1 x & d^2 x & d^3 x & d^4 \\ \\ 0 & 1 & 1 & 0 & 0 & 1 \\ 1 & 0 & 1 & 0 & 1 & 1 \\ 2 & 1 & 1 & 1 & 0 & 1 \\ 3 & 0 & 0 & 1 & 1 & 1 \\ 4 & 0 & 1 & 0 & 0 & 1 \\ 5 & 1 & 1 & 0 & 1 & 1 \\ 6 & 0 & 1 & 1 & 0 & 1 \\ 7 & 1 & 0 & 1 & 1 & 1 \\ \end{array}\) |
In this arrangement, the temporal ordering of states can be reckoned by a kind of parallel round-up rule. Specifically, if \((a_k, a_{k+1})\!\) is any pair of adjacent digits in a state vector \((a_0, a_1, \ldots, a_n),\!\) then the value of \(a_k\!\) in the next state is \(a_k^\prime = a_k + a_{k+1},\!\) the addition being taken mod 2, of course.
A more complete discussion of this arrangement is given here:
Example 4
I am going to tip-toe in silence/consilience past many questions of a philosophical nature/nurture that might be asked at this juncture, no doubt to revisit them at some future opportunity/importunity, however the cases happen to align in the course of their inevitable fall.
Instead, let's "keep it concrete and simple", taking up the consideration of an incrementally more complex example, but having a slightly more general character than the orders of sequential transformations that we've been discussing up to this point.
The types of logical transformations that I have in mind can be thought of as transformations of discourse because they map a universe of discourse into a universe of discourse by way of logical equations between the qualitative features or logical variables in the source and target universes.
The sequential transformations or state transitions that we have been considering so far are actually special cases of these more general logical transformations, specifically, they are the ones that have a single universe of discourse, as it happens to exist at different moments in time, in the role of both the source and the target universes of the transformation in question.
Onward and upward to Flatland, the differential analysis of transformations between 2-dimensional universes of discourse.
Consider the transformation from the universe \(U^\circ = [u, v]\) to the universe \(X^\circ = [x, y]\) that is defined by this system of equations:
|
\(\begin{array}{lcccc} x & = & f(u, v) & = & \texttt{((u)(v))} \\ \\ y & = & g(u, v) & = & \texttt{((u,~v))} \end{array}\) |
The underlined parenthetical expressions on the right are the cactus forms for the boolean functions that correspond to inclusive disjunction and logical equivalence, respectively. Table 1 summarizes the basic elements of the cactus notation for propositional logic.
| \(\text{Expression}\!\) | \(\text{Interpretation}\!\) | \(\text{Other Notations}\!\) |
| \(\texttt{~}\) | \(\operatorname{True}\) | \(1\!\) |
| \(\texttt{(~)}\) | \(\operatorname{False}\) | \(0\!\) |
| \(\texttt{x}\) | \(x\!\) | \(x\!\) |
| \(\texttt{(x)}\) | \(\operatorname{Not}\ x\) |
\(\begin{matrix} x' \\ \tilde{x} \\ \lnot x \\ \end{matrix}\) |
| \(\texttt{x~y~z}\) | \(x\ \operatorname{and}\ y\ \operatorname{and}\ z\) | \(x \land y \land z\) |
| \(\texttt{((x)(y)(z))}\) | \(x\ \operatorname{or}\ y\ \operatorname{or}\ z\) | \(x \lor y \lor z\) |
| \(\texttt{(x~(y))}\) |
\(\begin{matrix} x\ \operatorname{implies}\ y \\ \operatorname{If}\ x\ \operatorname{then}\ y \\ \end{matrix}\) |
\(x \Rightarrow y\!\) |
| \(\texttt{(x,~y)}\) |
\(\begin{matrix} x\ \operatorname{not~equal~to}\ y \\ x\ \operatorname{exclusive~or}\ y \\ \end{matrix}\) |
\(\begin{matrix} x \neq y \\ x + y \\ \end{matrix}\) |
| \(\texttt{((x,~y))}\) |
\(\begin{matrix} x\ \operatorname{is~equal~to}\ y \\ x\ \operatorname{if~and~only~if}\ y \\ \end{matrix}\) |
\(\begin{matrix} x = y \\ x \Leftrightarrow y \\ \end{matrix}\) |
| \(\texttt{(x,~y,~z)}\) |
\(\begin{matrix} \operatorname{Just~one~of} \\ x, y, z \\ \operatorname{is~false}. \\ \end{matrix}\) |
\(\begin{matrix} x'y~z~ & \lor \\ x~y'z~ & \lor \\ x~y~z' & \\ \end{matrix}\) |
| \(\texttt{((x),(y),(z))}\) |
\(\begin{matrix} \operatorname{Just~one~of} \\ x, y, z \\ \operatorname{is~true}. \\ & \\ \operatorname{Partition~all} \\ \operatorname{into}\ x, y, z. \\ \end{matrix}\) |
\(\begin{matrix} x~y'z' & \lor \\ x'y~z' & \lor \\ x'y'z~ & \\ \end{matrix}\) |
|
\(\begin{matrix} \texttt{((x,~y),~z)} \\ \\ \texttt{(x,~(y,~z))} \end{matrix}\) |
\(\begin{matrix} \operatorname{Oddly~many~of} \\ x, y, z \\ \operatorname{are~true}. \\ \end{matrix}\) |
\(x + y + z\!\)
\(\begin{matrix} x~y~z~ & \lor \\ x~y'z' & \lor \\ x'y~z' & \lor \\ x'y'z~ & \\ \end{matrix}\) |
| \(\texttt{(w,~(x),(y),(z))}\) |
\(\begin{matrix} \operatorname{Partition}\ w \\ \operatorname{into}\ x, y, z. \\ & \\ \operatorname{Genus}\ w\ \operatorname{comprises} \\ \operatorname{species}\ x, y, z. \\ \end{matrix}\) |
\(\begin{matrix} w'x'y'z' & \lor \\ w~x~y'z' & \lor \\ w~x'y~z' & \lor \\ w~x'y'z~ & \\ \end{matrix}\) |
The component notation \(F = (F_1, F_2) = (f, g) : U^\circ \to X^\circ\) allows us to give a name and a type to this transformation, and permits us to define it by means of the compact description that follows:
|
\(\begin{array}{lcccc} (x, y) & = & F(u, v) & = & ( ~\texttt{((u)(v))}~ , ~\texttt{((u,~v))}~ ). \end{array}\) |
The information that defines the logical transformation \(F\!\) can be represented in the form of a truth table, as below.
| \(u\!\) | \(v\!\) | \(f\!\) | \(g\!\) |
| \(0\!\) | \(0\!\) | \(0\!\) | \(1\!\) |
| \(0\!\) | \(1\!\) | \(1\!\) | \(0\!\) |
| \(1\!\) | \(0\!\) | \(1\!\) | \(0\!\) |
| \(1\!\) | \(1\!\) | \(1\!\) | \(1\!\) |
A more complete framework of discussion and a fuller development of this example can be found in the neighborhood of the following site:
Consider the "transformation of textual elements" (TOTE) in progress:
|
\(\begin{array}{ccccc} x & = & f(u, v) & = & \texttt{((u)(v))} \\ \\ y & = & g(u, v) & = & \texttt{((u,~v))} \\ \\ (x, y) & = & F(u, v) & = & ( ~\texttt{((u)(v))}~ , ~\texttt{((u,~v))}~ ) \end{array}\) |
Taken as a transformation from the universe \(U^\circ = [u, v]\) to the universe \(X^\circ = [x, y],\) this is a particular type of formal object, and it can be studied at that level of abstraction until the chickens come home to roost, as they say, but when the time comes to count those chickens, if you will, the terms of artifice that we use to talk about abstract objects, almost as if we actually knew what we were talking about, need to be fully fledged or fleshed out with extra "bits of interpretive data" (BOIDs).
And so, to decompress the story, the TOTE that we use to convey the FOMA has to be interpreted before it can be applied to anything that actually puts supper on the table, so to speak.
What are some of the ways that an abstract logical transformation like \(F\!\) gets interpreted in the setting of a concrete application?
Mathematical parlance comes part way to the rescue here and tosses us the line that a transformation of syntactic signs can be interpreted in either one of two ways, as an alias or as an alibi.
When we consider a transformation in the alias interpretation, we are merely changing the terms that we use to describe what may very well be, to some approximation, the very same things.
For example, in some applications the discursive universes \(U^\circ = [u, v]\) and \(X^\circ = [x, y]\) are best understood as diverse frames, instruments, reticules, scopes, or templates, that we adopt for the sake of viewing from variant perspectives what we conceive to be roughly the same underlying objects.
When we consider a transformation in the alibi interpretation, we are thinking of the objective things as objectively moving around in space or changing their qualitative characteristics. There are times when we think of this alibi transformation as taking place in a dimension of time, and then there are times when time is not an object.
For example, in some applications the discursive universes \(U^\circ = [u, v]\) and \(X^\circ = [x, y]\) are actually the same universe, and what we have is a frame where \(x\!\) is the next state of \(u\!\) and \(y\!\) is the next state of \(v,\!\) notated as \(x = u'\!\) and \(y = v'.\!\) This permits us to rewrite the transformation \(F\!\) as follows:
|
\(\begin{array}{ccccc} u' & = & f(u, v) & = & \texttt{((u)(v))} \\ \\ v' & = & g(u, v) & = & \texttt{((u,~v))} \\ \\ (u', v') & = & F(u, v) & = & ( ~\texttt{((u)(v))}~ , ~\texttt{((u,~v))}~ ) \end{array}\) |
All in all, then, we have three different ways in general of applying or interpreting a transformation of discourse, that we might sum up as one brand of alias and two brands of alibi, all together, the Elseword, the Elsewhere, and the Elsewhen.
No more angels on pinheads, the brass tacks next time.
Differential Analysis
It is time to formulate the differential analysis of a logical transformation, or a mapping of discourse. It is wise to begin with the first order differentials.
We are considering an abstract logical transformation \(F = (f, g) : [u, v] \to [x, y]\) that can be interpreted in a number of different ways. Let's fix on a couple of major variants that might be indicated as follows:
|
\(\begin{array}{lccccc} \text{Alias Map.} & (x, y) & = & F(u, v) & = & ( ~\texttt{((u)(v))}~ , ~\texttt{((u,~v))}~ ) \\ \\ \text{Alibi Map.} & (u', v') & = & F(u, v) & = & ( ~\texttt{((u)(v))}~ , ~\texttt{((u,~v))}~ ) \end{array}\) |
\(F\!\) is just one example among — well, now that I think of it — how many other logical transformations from the same source to the same target universe? In the light of that question, maybe it would be advisable to contemplate the character of \(F\!\) within the fold of its most closely akin transformations.
Given the alphabets \(\mathcal{U} = \{ u, v \}\) and \(\mathcal{X} = \{ x, y \},\) along with the corresponding universes of discourse \(U^\circ\) and \(X^\circ = [\mathbb{B}^2],\) how many logical transformations of the general form \(G = (G_1, G_2) : U^\circ \to X^\circ\) are there?
Since \(G_1\!\) and \(G_2\!\) can be any propositions of the type \(\mathbb{B}^2 \to \mathbb{B},\) there are \(2^4 = 16\!\) choices for each of the maps \(G_1\!\) and \(G_2,\!\) and thus there are \(2^4 \cdot 2^4 = 2^8 = 256\!\) different mappings altogether of the form \(G : U^\circ \to X^\circ.\)
The set of all functions of a given type is customarily denoted by placing its type indicator in parentheses, in the present instance writing \((U^\circ \to X^\circ) = \{ G : U^\circ \to X^\circ \},\) and so the cardinality of this function space can most conveniently be summed up by writing:
| \(|(U^\circ \to X^\circ)| ~=~ |(\mathbb{B}^2 \to \mathbb{B}^2)| ~=~ 4^4 ~=~ 256.\) |
Given any transformation of this type, \(G : U^\circ \to X^\circ,\) the (first order) differential analysis of \(G\!\) is based on the definition of a couple of further transformations, derived by way of operators on \(G,\!\) that ply between the (first order) extended universes, \(\operatorname{E}U^\circ = [u, v, du, dv]\) and \(\operatorname{E}X^\circ = [x, y, dx, dy],\) of \(G \operatorname{'s}\!\) own source and target universes.
First, the enlargement map (or the secant transformation) \(\operatorname{E}G = (\operatorname{E}G_1, \operatorname{E}G_2) : \operatorname{E}U^\circ \to \operatorname{E}X^\circ\) is defined by the following pair of component equations:
|
\(\begin{array}{lll} \operatorname{E}G_1 & = & G_1 (u + du, v + dv) \\ \\ \operatorname{E}G_2 & = & G_2 (u + du, v + dv) \end{array}\) |
Second, the difference map (or the chordal transformation) \(\operatorname{D}G = (\operatorname{D}G_1, \operatorname{D}G_2) : \operatorname{E}U^\circ \to \operatorname{E}X^\circ\) is defined in a component-wise fashion as the boolean sum of the initial proposition \(G_j\!\) and the enlarged or shifted proposition \(\operatorname{E}G_j,\) for \(j = 1, 2,\!\) in accord with following pair of equations:
|
\(\begin{array}{lllll} \operatorname{D}G_1 & = & G_1 (u, v) & + & \operatorname{E}G_1 (u, v, du, dv) \\ \\ & = & G_1 (u, v) & + & G_1 (u + du, v + dv) \\ \\ \operatorname{D}G_2 & = & G_2 (u, v) & + & \operatorname{E}G_2 (u, v, du, dv) \\ \\ & = & G_2 (u, v) & + & G_2 (u + du, v + dv) \end{array}\) |
Maintaining a strict analogy with ordinary difference calculus would perhaps have us write \(\operatorname{D}G_j = \operatorname{E}G_j - G_j,\) but the sum and difference operations are the same thing in boolean arithmetic. It is more often natural in the logical context to consider an initial proposition \(q,\!\) then to compute the enlargement \(\operatorname{E}q,\) and finally to determine the difference \(\operatorname{D}q = q + \operatorname{E}q,\) so we let the variant order of terms reflect this sequence of considerations.
Given these general considerations about the operators \(\operatorname{E}\) and \(\operatorname{D},\) let's return to particular cases, and carry out the first order analysis of the transformation \(F(u, v) ~=~ ( ~\texttt{((u)(v))}~ , ~\texttt{((u,~v))}~ ).\)
By way of getting our feet back on solid ground, let's crank up our current case of a transformation of discourse, \(F : U^\circ \to X^\circ,\) with concrete type \([u, v] \to [x, y]\) or abstract type \(\mathbb{B}^2 \to \mathbb{B}^2,\) and let it spin through a sufficient number of turns to see how it goes, as viewed under the scope of what is probably its most straightforward view, as an elsewhen map \(F : [u, v] \to [u', v'].\)
|
\(\begin{array}{ccc} \texttt{u}' & = & \texttt{((u)(v))} \\ \texttt{v}' & = & \texttt{((u,~v))} \end{array}\) |
|
\(\begin{matrix} \text{Orbit 1} \\ \text{Initial Point :}~ (u, v) = (1, 1) \end{matrix}\) |
|
\(\begin{array}{c|cc} t & u & v \\ \\ 0 & 1 & 1 \\ 1 & 1 & 1 \\ 2 & '' & '' \\ \end{array}\) |
|
\(\begin{matrix} \text{Orbit 2} \\ \text{Initial Point :}~ (u, v) = (0, 0) \end{matrix}\) |
|
\(\begin{array}{c|cc} t & u & v \\ \\ 0 & 0 & 0 \\ 1 & 0 & 1 \\ 2 & 1 & 0 \\ 3 & 1 & 0 \\ 4 & '' & '' \\ \end{array}\) |
In the upshot there are two basins of attraction, the state \((1, 1)\!\) and the state \((1, 0),\!\) with the orbit \((1, 1)\!\) making up an isolated basin and the orbit \((0, 0), (0, 1), (1, 0)\!\) leading to the basin \((1, 0).\!\)
On first examination of our present example we made a likely guess at a form of rule that would account for the finite protocol of states that we observed the system \(X\!\) passing through, as spied in the light of its boolean state variable \(x : X \to \mathbb{B},\) and that rule is well-formulated in any of these styles of notation:
|
\(\begin{array}{ll} 1.1. & f : \mathbb{B} \to \mathbb{B} ~\text{such that}~ f : \texttt{x} \mapsto \texttt{(x)} \\ 1.2. & \texttt{x}' ~=~ \texttt{(x)} \\ 1.3. & \texttt{x} ~:=~ \texttt{(x)} \\ 1.4. & \texttt{dx} ~=~ \texttt{1} \end{array}\) |
In the current example, we already know in advance the program that generates the state transitions, and it is a rule of the following equivalent and easily derivable forms:
|
\(\begin{array}{ll} 2.1. & F : \mathbb{B}^2 \to \mathbb{B}^2 ~\text{such that}~ F : (\texttt{u}, \texttt{v}) \mapsto ( ~\texttt{((u)(v))}~ , ~\texttt{((u,~v))}~ ) \\ 2.2. & \texttt{u}' ~=~ \texttt{((u)(v))}~, \quad \texttt{v}' ~=~ \texttt{((u,~v))} \\ 2.3. & \texttt{u} ~:=~ \texttt{((u)(v))}~, \quad \texttt{v} ~:=~ \texttt{((u,~v))} \\ 2.4. & ??? \end{array}\) |
Well, the last one is not such a fall off the log, but that is exactly the purpose for which we have been developing all of the foregoing machinations.
Here is what I got when I just went ahead and calculated the finite differences willy-nilly:
| \(\text{Orbit 1. Intitial Point :}~ (u, v) = (1, 1)\) |
|
\(\begin{array}{c|cc|cc|cc|cc|cc|c} t & u & v & du & dv & d^2 u & d^2 v & d^3 u & d^3 v & d^4 u & d^4 v & \ldots \\ \\ 0 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ 4 & '' & '' & '' & '' & '' & '' & '' & '' & '' & '' & \ldots \\ \end{array}\) |
| \(\text{Orbit 2. Intitial Point :}~ (u, v) = (0, 0)\) |
|
\(\begin{array}{c|cc|cc|cc|cc|cc|c} t & u & v & du & dv & d^2 u & d^2 v & d^3 u & d^3 v & d^4 u & d^4 v & \ldots \\ \\ 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 1 & 1 & 0 & \ldots \\ 1 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & \ldots \\ 2 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ 3 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ 4 & '' & '' & '' & '' & '' & '' & '' & '' & '' & '' & \ldots \\ \end{array}\) |
To be honest, I have never thought of trying to hack the problem in such a brute-force way until just now, and so I know enough to expect a not inappreciable probability of error about all that I've taken the risk to write out here, but let me forge ahead and see what I can see.
What we are looking for is — one rule to rule them all, a rule that applies to every state and works every time.
What we see at first sight in the tables above are patterns of differential features that attach to the states in each orbit of the dynamics. Looked at locally to these orbits, the isolated fixed point at \((1, 1)\!\) is no problem, as the rule \(\texttt{du~=~dv~=~0}\) describes it pithily enough. When it comes to the other orbit, the first thing that comes to mind is to write out the law \(\texttt{du~=~v}, ~\texttt{dv~=~(u)}.\)
Symbolic Method
It ought to be clear at this point that we need a more systematic symbolic method for computing the differentials of logical transformations, using the term differential in a loose way at present for all sorts of finite differences and derivatives, leaving it to another discussion to sharpen up its more exact technical senses.
For convenience of reference, let's recast our current example in the following form:
|
\(\begin{array}{lllll} F & = & (f, g) & = & ( ~\texttt{((u)(v))}~ , ~\texttt{((u,~v))}~ ). \end{array}\) |
In their application to this logical transformation the operators \(\operatorname{E}\) and \(\operatorname{D}\) respectively produce the enlarged map \(\operatorname{E}F = (\operatorname{E}f, \operatorname{E}g)\) and the difference map \(\operatorname{D}F = (\operatorname{D}f, \operatorname{D}g),\) whose components can be given as follows, if the reader, in the absence of a special format for logical parentheses, can forgive syntactically bilingual phrases:
|
\(\begin{array}{lll} \operatorname{E}f & = & \texttt{(( u + du )( v + dv ))} \\ \\ \operatorname{E}g & = & \texttt{(( u + du ,~ v + dv ))} \\ \\ \operatorname{D}f & = & \texttt{((u)(v)) ~+~ (( u + du )( v + dv ))} \\ \\ \operatorname{D}g & = & \texttt{((u,~v)) ~+~ (( u + du ,~ v + dv ))} \end{array}\) |
But these initial formulas are purely definitional, and help us little to understand either the purpose of the operators or the significance of the results. Working symbolically, let's apply a more systematic method to the separate components of the mapping \(F.\!\)
A sketch of this work is presented in the following series of Figures, where each logical proposition is expanded over the basic cells \(\texttt{uv}, \texttt{u(v)}, \texttt{(u)v}, \texttt{(u)(v)}\) of the 2-dimensional universe of discourse \(U^\circ = [u, v].\!\)
Computation Summary \[f(u, v) = \texttt{((u)(v))}\]
The venn diagram in Figure 1.1 shows how the proposition \(f = \texttt{((u)(v))}\) can be expanded over the universe of discourse \([u, v]\!\) to produce a logically equivalent exclusive disjunction, namely, \(\texttt{uv~+~u(v)~+~(u)v}.\)
o---------------------------------------o | | | o | | /%\ | | /%%%\ | | /%%%%%\ | | o%%%%%%%o | | /%\%%%%%/%\ | | /%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o | | /%\%%%%%/%\%%%%%/%\ | | /%%%\%%%/%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o%%%%%%%o | | /%\%%%%%/%\%%%%%/%\%%%%%/%\ | | /%%%\%%%/%%%\%%%/%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\%/%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o%%%%%%%o%%%%%%%o | | |\%%%%%/%\%%%%%/ \%%%%%/%\%%%%%/| | | | \%%%/%%%\%%%/ \%%%/%%%\%%%/ | | | | \%/%%%%%\%/ \%/%%%%%\%/ | | | | o%%%%%%%o o%%%%%%%o | | | | |\%%%%%/ \ / \%%%%%/| | | | | | \%%%/ \ / \%%%/ | | | | | u | \%/ \ / \%/ | v | | | o---+---o o o---+---o | | | \ / \ / | | | | \ / \ / | | | | du \ / \ / dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 1.1. f = ((u)(v))
Figure 1.2 expands \(\operatorname{E}f = \texttt{((u + du)(v + dv))}\) over \([u, v]\!\) to give:
| \(\texttt{uv~(du~dv) ~+~ u(v)~(du (dv)) ~+~ (u)v~((du) dv) ~+~ (u)(v)~((du)(dv))}\) |
o---------------------------------------o | | | o | | /%\ | | /%%%\ | | /%%%%%\ | | o%%%%%%%o | | /%\%%%%%/%\ | | /%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o | | /%\%%%%%/ \%%%%%/%\ | | /%%%\%%%/ \%%%/%%%\ | | /%%%%%\%/ \%/%%%%%\ | | o%%%%%%%o o%%%%%%%o | | /%\%%%%%/%\ /%\%%%%%/%\ | | /%%%\%%%/%%%\ /%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\ /%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o%%%%%%%o%%%%%%%o | | |\%%%%%/ \%%%%%/%\%%%%%/ \%%%%%/| | | | \%%%/ \%%%/%%%\%%%/ \%%%/ | | | | \%/ \%/%%%%%\%/ \%/ | | | | o o%%%%%%%o o | | | | |\ /%\%%%%%/%\ /| | | | | | \ /%%%\%%%/%%%\ / | | | | | u | \ /%%%%%\%/%%%%%\ / | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/ \%%%%%/ | | | | \%%%/ \%%%/ | | | | du \%/ \%/ dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 1.2. Ef = ((u + du)(v + dv))
Figure 1.3 expands \(\operatorname{D}f = f + \operatorname{E}f\) over \([u, v]\!\) to produce:
| \(\texttt{uv~du~dv ~+~ u(v)~du(dv) ~+~ (u)v~(du)dv ~+~ (u)(v)~((du)(dv))}\) |
o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | / \ / \ | | / \ / \ | | / \ / \ | | o o o | | / \ /%\ / \ | | / \ /%%%\ / \ | | / \ /%%%%%\ / \ | | o o%%%%%%%o o | | / \ / \%%%%%/ \ / \ | | / \ / \%%%/ \ / \ | | / \ / \%/ \ / \ | | o o o o o | | |\ /%\ /%\ /%\ /| | | | \ /%%%\ /%%%\ /%%%\ / | | | | \ /%%%%%\ /%%%%%\ /%%%%%\ / | | | | o%%%%%%%o%%%%%%%o%%%%%%%o | | | | |\%%%%%/%\%%%%%/%\%%%%%/| | | | | | \%%%/%%%\%%%/%%%\%%%/ | | | | | u | \%/%%%%%\%/%%%%%\%/ | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/ \%%%%%/ | | | | \%%%/ \%%%/ | | | | du \%/ \%/ dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 1.3. Df = f + Ef
I'll break this here in case anyone wants to try and do the work for \(g\!\) on their own.
Computation Summary \[g(u, v) = \texttt{((u,~v))}\]
The venn diagram in Figure 2.1 shows how the proposition \(g = \texttt{((u,~v))}\) can be expanded over the universe of discourse \([u, v]\!\) to produce a logically equivalent exclusive disjunction, namely, \(\texttt{uv ~+~ (u)(v)}.\)
o---------------------------------------o | | | o | | /%\ | | /%%%\ | | /%%%%%\ | | o%%%%%%%o | | /%\%%%%%/%\ | | /%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o | | / \%%%%%/%\%%%%%/ \ | | / \%%%/%%%\%%%/ \ | | / \%/%%%%%\%/ \ | | o o%%%%%%%o o | | / \ / \%%%%%/ \ / \ | | / \ / \%%%/ \ / \ | | / \ / \%/ \ / \ | | o o o o o | | |\ / \ /%\ / \ /| | | | \ / \ /%%%\ / \ / | | | | \ / \ /%%%%%\ / \ / | | | | o o%%%%%%%o o | | | | |\ /%\%%%%%/%\ /| | | | | | \ /%%%\%%%/%%%\ / | | | | | u | \ /%%%%%\%/%%%%%\ / | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/%\%%%%%/ | | | | \%%%/%%%\%%%/ | | | | du \%/%%%%%\%/ dv | | | o-------o%%%%%%%o-------o | | \%%%%%/ | | \%%%/ | | \%/ | | o | | | o---------------------------------------o Figure 2.1. g = ((u, v))
Figure 2.2 expands \(\operatorname{E}g = \texttt{((u + du,~v + dv))}\) over \([u, v]\!\) to give:
| \(\texttt{uv~((du,~dv)) ~+~ u(v)~(du,~dv) ~+~ (u)v~(du,~dv) ~+~ (u)(v)~((du,~dv))}\) |
o---------------------------------------o | | | o | | /%\ | | /%%%\ | | /%%%%%\ | | o%%%%%%%o | | / \%%%%%/ \ | | / \%%%/ \ | | / \%/ \ | | o o o | | /%\ /%\ /%\ | | /%%%\ /%%%\ /%%%\ | | /%%%%%\ /%%%%%\ /%%%%%\ | | o%%%%%%%o%%%%%%%o%%%%%%%o | | / \%%%%%/ \%%%%%/ \%%%%%/ \ | | / \%%%/ \%%%/ \%%%/ \ | | / \%/ \%/ \%/ \ | | o o o o o | | |\ /%\ /%\ /%\ /| | | | \ /%%%\ /%%%\ /%%%\ / | | | | \ /%%%%%\ /%%%%%\ /%%%%%\ / | | | | o%%%%%%%o%%%%%%%o%%%%%%%o | | | | |\%%%%%/ \%%%%%/ \%%%%%/| | | | | | \%%%/ \%%%/ \%%%/ | | | | | u | \%/ \%/ \%/ | v | | | o---+---o o o---+---o | | | \ /%\ / | | | | \ /%%%\ / | | | | du \ /%%%%%\ / dv | | | o-------o%%%%%%%o-------o | | \%%%%%/ | | \%%%/ | | \%/ | | o | | | o---------------------------------------o Figure 2.2. Eg = ((u + du, v + dv))
Figure 2.3 expands \(\operatorname{D}g = g + \operatorname{E}g\) over \([u, v]\!\) to yield the form:
| \(\texttt{uv~(du,~dv) ~+~ u(v)~(du,~dv) ~+~ (u)v~(du,~dv) ~+~ (u)(v)~(du,~dv)}\) |
o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | /%\ /%\ | | /%%%\ /%%%\ | | /%%%%%\ /%%%%%\ | | o%%%%%%%o%%%%%%%o | | /%\%%%%%/ \%%%%%/%\ | | /%%%\%%%/ \%%%/%%%\ | | /%%%%%\%/ \%/%%%%%\ | | o%%%%%%%o o%%%%%%%o | | / \%%%%%/ \ / \%%%%%/ \ | | / \%%%/ \ / \%%%/ \ | | / \%/ \ / \%/ \ | | o o o o o | | |\ /%\ / \ /%\ /| | | | \ /%%%\ / \ /%%%\ / | | | | \ /%%%%%\ / \ /%%%%%\ / | | | | o%%%%%%%o o%%%%%%%o | | | | |\%%%%%/%\ /%\%%%%%/| | | | | | \%%%/%%%\ /%%%\%%%/ | | | | | u | \%/%%%%%\ /%%%%%\%/ | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/ \%%%%%/ | | | | \%%%/ \%%%/ | | | | du \%/ \%/ dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 2.3. Dg = g + Eg
Differential : Locally Linear Approximation
|
'Tis a derivative from me to mine, | |
| — Winter's Tale, 3.2.43–44 |
We've talked about differentials long enough that I think it's way past time we met with some.
When the term is being used with its more exact sense, a differential is a locally linear approximation to a function, in the context of this logical discussion, then, a locally linear approximation to a proposition.
Recall the form of the current example:
|
\(\begin{array}{lllll} F & = & (f, g) & = & ( ~\texttt{((u)(v))}~ , ~\texttt{((u,~v))}~ ). \end{array}\) |
To speed things along, I will skip a mass of motivating discussion and just exhibit the simplest form of a differential \(\operatorname{d}F\!\) for the current example of a logical transformation \(F,\!\) after which the majority of the easiest questions will have been answered in visually intuitive terms.
For \(F = (f, g)\!\) we have \(\operatorname{d}F = (\operatorname{d}f, \operatorname{d}g),\) and so we can proceed componentwise, patching the pieces back together at the end.
We have prepared the ground already by computing these terms:
|
\(\begin{array}{lll} \operatorname{E}f & = & \texttt{(( u + du )( v + dv ))} \\ \\ \operatorname{E}g & = & \texttt{(( u + du ,~ v + dv ))} \\ \\ \operatorname{D}f & = & \texttt{((u)(v)) ~+~ (( u + du )( v + dv ))} \\ \\ \operatorname{D}g & = & \texttt{((u,~v)) ~+~ (( u + du ,~ v + dv ))} \end{array}\) |
As a matter of fact, computing the symmetric differences \(\operatorname{D}f = f + \operatorname{E}f\) and \(\operatorname{D}g = g + \operatorname{E}g\) has already taken care of the localizing part of the task by subtracting out the forms of \(f\!\) and \(g\!\) from the forms of \(\operatorname{E}f\) and \(\operatorname{E}g,\) respectively. Thus all we have left to do is to decide what linear propositions best approximate the difference maps \(\operatorname{D}f\) and \(\operatorname{D}g,\) respectively.
This raises the question: What is a linear proposition?
The answer that makes the most sense in this context is this: A proposition is just a boolean-valued function, so a linear proposition is a linear function into the boolean space \(\mathbb{B}.\)
In particular, the linear functions that we want will be linear functions in the differential variables \(du\!\) and \(dv.\!\)
As it turns out, there are just four linear propositions in the associated differential universe \(\operatorname{d}U^\circ = [du, dv],\) and these are the propositions that are commonly denoted\[\texttt{0}, \texttt{du}, \texttt{dv}, \texttt{du + dv},\] in other words, \(\texttt{()}, \texttt{du}, \texttt{dv}, \texttt{(du, dv)}.\)
Notions of Approximation
|
for equalities are so weighed | |
| — King Lear, Sc.1.5–7 (Quarto) | |
|
for qualities are so weighed | |
| — King Lear, 1.1.5–6 (Folio) |
Justifying a notion of approximation is a little more involved in general, and especially in these discrete logical spaces, than it would be expedient for people in a hurry to tangle with right now. I will just say that there are naive or obvious notions and there are sophisticated or subtle notions that we might choose among. The later would engage us in trying to construct proper logical analogues of Lie derivatives, and so let's save that for when we have become subtle or sophisticated or both. Against or toward that day, as you wish, let's begin with an option in plain view.
Figure 1.4 illustrates one way of ranging over the cells of the underlying universe \(U^\circ = [u, v]\!\) and selecting at each cell the linear proposition in \(\operatorname{d}U^\circ = [du, dv]\) that best approximates the patch of the difference map \(\operatorname{D}f\) that is located there, yielding the following formula for the differential \(\operatorname{d}f.\)
| \(\operatorname{d}f ~=~ \texttt{uv} \cdot \texttt{0} ~+~ \texttt{u(v)} \cdot \texttt{du} ~+~ \texttt{(u)v} \cdot \texttt{dv} ~+~ \texttt{(u)(v)} \cdot \texttt{(du, dv)}\) |
o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | / \ / \ | | / \ / \ | | / \ / \ | | o o o | | / \ / \ / \ | | / \ / \ / \ | | / \ / \ / \ | | o o o o | | / \ /%\ /%\ / \ | | / \ /%%%\ /%%%\ / \ | | / \ /%%%%%\ /%%%%%\ / \ | | o o%%%%%%%o%%%%%%%o o | | |\ /%\%%%%%/ \%%%%%/%\ /| | | | \ /%%%\%%%/ \%%%/%%%\ / | | | | \ /%%%%%\%/ \%/%%%%%\ / | | | | o%%%%%%%o o%%%%%%%o | | | | |\%%%%%/%\ /%\%%%%%/| | | | | | \%%%/%%%\ /%%%\%%%/ | | | | | u | \%/%%%%%\ /%%%%%\%/ | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/ \%%%%%/ | | | | \%%%/ \%%%/ | | | | du \%/ \%/ dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 1.4. df = linear approx to Df
Figure 2.4 illustrates one way of ranging over the cells of the underlying universe \(U^\circ = [u, v]\!\) and selecting at each cell the linear proposition in \(\operatorname{d}U^\circ = [du, dv]\) that best approximates the patch of the difference map \(\operatorname{D}g\) that is located there, yielding the following formula for the differential \(\operatorname{d}g.\)
| \(\operatorname{d}g ~=~ \texttt{uv} \cdot \texttt{(du, dv)} ~+~ \texttt{u(v)} \cdot \texttt{(du, dv)} ~+~ \texttt{(u)v} \cdot \texttt{(du, dv)} ~+~ \texttt{(u)(v)} \cdot \texttt{(du, dv)}\) |
o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | /%\ /%\ | | /%%%\ /%%%\ | | /%%%%%\ /%%%%%\ | | o%%%%%%%o%%%%%%%o | | /%\%%%%%/ \%%%%%/%\ | | /%%%\%%%/ \%%%/%%%\ | | /%%%%%\%/ \%/%%%%%\ | | o%%%%%%%o o%%%%%%%o | | / \%%%%%/ \ / \%%%%%/ \ | | / \%%%/ \ / \%%%/ \ | | / \%/ \ / \%/ \ | | o o o o o | | |\ /%\ / \ /%\ /| | | | \ /%%%\ / \ /%%%\ / | | | | \ /%%%%%\ / \ /%%%%%\ / | | | | o%%%%%%%o o%%%%%%%o | | | | |\%%%%%/%\ /%\%%%%%/| | | | | | \%%%/%%%\ /%%%\%%%/ | | | | | u | \%/%%%%%\ /%%%%%\%/ | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/ \%%%%%/ | | | | \%%%/ \%%%/ | | | | du \%/ \%/ dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 2.4. dg = linear approx to Dg
Well, \(g,\!\) that was easy, seeing as how \(\operatorname{D}g\) is already linear at each locus, \(\operatorname{d}g = \operatorname{D}g.\)
Analytic Series
We have been conducting the differential analysis of the logical transformation \(F : [u, v] \mapsto [u, v]\) defined as \(F : (u, v) \mapsto ( ~\texttt{((u)(v))}~, ~\texttt{((u, v))}~ ),\) and this means starting with the extended transformation \(\operatorname{E}F : [u, v, du, dv] \to [u, v, du, dv]\) and breaking it into an analytic series, \(\operatorname{E}F = F + \operatorname{d}F + \operatorname{d}^2 F + \ldots,\) and so on until there is nothing left to analyze any further.
As a general rule, one proceeds by way of the following stages:
|
\(\begin{array}{lccccc} 1. & \operatorname{E}F & = & \operatorname{d}^0 F & + & \operatorname{r}^0 F \\ 2. & \operatorname{r}^0 F & = & \operatorname{d}^1 F & + & \operatorname{r}^1 F \\ 3. & \operatorname{r}^1 F & = & \operatorname{d}^2 F & + & \operatorname{r}^2 F \\ 4. & \ldots \end{array}\) |
In our analysis of the transformation \(F,\!\) we carried out Step 1 in the more familiar form \(\operatorname{E}F = F + \operatorname{D}F,\) and we have just reached Step 2 in the form \(\operatorname{D}F = \operatorname{d}F + \operatorname{r}F,\) where \(\operatorname{r}F\) is the residual term that remains for us to examine next.
NB. I'm am trying to give quick overview here, and this forces me to omit many picky details. The picky reader may wish to consult the more detailed presentation of this material at the following locations:
Let's push on with the analysis of the transformation:
|
\(\begin{matrix} F & : & (u, v) & \mapsto & (f(u, v),~g(u, v)) & = & (~\texttt{((u)(v))}~,~\texttt{((u,~v))}~).\end{matrix}\) |
For ease of comparison and computation, I will collect the Figures that we need for the remainder of the work together on one page.
Computation Summary \[f(u, v) = \texttt{((u)(v))}\]
Figure 1.1 shows the expansion of \(f = \texttt{((u)(v))}\) over \([u, v]\!\) to produce the expression:
| \(\texttt{uv} ~+~ \texttt{u(v)} ~+~ \texttt{(u)v}\) |
Figure 1.2 shows the expansion of \(\operatorname{E}f = \texttt{((u + du)(v + dv))}\) over \([u, v]\!\) to produce the expression:
| \(\texttt{uv} \cdot \texttt{(du~dv)} + \texttt{u(v)} \cdot \texttt{(du (dv))} + \texttt{(u)v} \cdot \texttt{((du) dv)} + \texttt{(u)(v)} \cdot \texttt{((du)(dv))}\) |
\(\operatorname{E}f\) tells you what you would have to do, from where you are in the universe \([u, v],\!\) if you want to end up in a place where \(f\!\) is true. In this case, where the prevailing proposition \(f\!\) is \(\texttt{((u)(v))},\) the indication \(\texttt{uv} \cdot \texttt{(du~dv)}\) of \(\operatorname{E}f\) tells you this: If \(u\!\) and \(v\!\) are both true where you are, then just don't change both \(u\!\) and \(v\!\) at once, and you will end up in a place where \(\texttt{((u)(v))}\) is true.
Figure 1.3 shows the expansion of \(\operatorname{D}f\) over \([u, v]\!\) to produce the expression:
| \(\texttt{uv} \cdot \texttt{du~dv} ~+~ \texttt{u(v)} \cdot \texttt{du(dv)} ~+~ \texttt{(u)v} \cdot \texttt{(du)dv} ~+~ \texttt{(u)(v)} \cdot \texttt{((du)(dv))}\) |
\(\operatorname{D}f\) tells you what you would have to do, from where you are in the universe \([u, v],\!\) if you want to bring about a change in the value of \(f,\!\) that is, if you want to get to a place where the value of \(f\!\) is different from what it is where you are. In the present case, where the reigning proposition \(f\!\) is \(\texttt{((u)(v))},\) the term \(\texttt{uv} \cdot \texttt{du~dv}\) of \(\operatorname{D}f\) tells you this: If \(u\!\) and \(v\!\) are both true where you are, then you would have to change both \(u\!\) and \(v\!\) in order to reach a place where the value of \(f\!\) is different from what it is where you are.
Figure 1.4 approximates \(\operatorname{D}f\) by the linear form \(\operatorname{d}f\) that expands over \([u, v]\!\) as follows:
|
\(\begin{matrix} \operatorname{d}f & = & \texttt{uv} \cdot \texttt{0} & + & \texttt{u(v)} \cdot \texttt{du} & + & \texttt{(u)v} \cdot \texttt{dv} & + & \texttt{(u)(v)} \cdot \texttt{(du, dv)} \\ \\ & = & & & \texttt{u(v)} \cdot \texttt{du} & + & \texttt{(u)v} \cdot \texttt{dv} & + & \texttt{(u)(v)} \cdot \texttt{(du, dv)} \end{matrix}\) |
Figure 1.5 shows what remains of the difference map \(\operatorname{D}f\) when the first order linear contribution \(\operatorname{d}f\) is removed, namely:
|
\(\begin{matrix} \operatorname{r}f & = & \texttt{uv} \cdot \texttt{du~dv} & + & \texttt{u(v)} \cdot \texttt{du~dv} & + & \texttt{(u)v} \cdot \texttt{du~dv} & + & \texttt{(u)(v)} \cdot \texttt{du~dv} \\ \\ & = & \texttt{du~dv} \end{matrix}\) |
o---------------------------------------o | | | o | | /%\ | | /%%%\ | | /%%%%%\ | | o%%%%%%%o | | /%\%%%%%/%\ | | /%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o | | /%\%%%%%/%\%%%%%/%\ | | /%%%\%%%/%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o%%%%%%%o | | /%\%%%%%/%\%%%%%/%\%%%%%/%\ | | /%%%\%%%/%%%\%%%/%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\%/%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o%%%%%%%o%%%%%%%o | | |\%%%%%/%\%%%%%/ \%%%%%/%\%%%%%/| | | | \%%%/%%%\%%%/ \%%%/%%%\%%%/ | | | | \%/%%%%%\%/ \%/%%%%%\%/ | | | | o%%%%%%%o o%%%%%%%o | | | | |\%%%%%/ \ / \%%%%%/| | | | | | \%%%/ \ / \%%%/ | | | | | u | \%/ \ / \%/ | v | | | o---+---o o o---+---o | | | \ / \ / | | | | \ / \ / | | | | du \ / \ / dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 1.1. f = ((u)(v))
o---------------------------------------o | | | o | | /%\ | | /%%%\ | | /%%%%%\ | | o%%%%%%%o | | /%\%%%%%/%\ | | /%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o | | /%\%%%%%/ \%%%%%/%\ | | /%%%\%%%/ \%%%/%%%\ | | /%%%%%\%/ \%/%%%%%\ | | o%%%%%%%o o%%%%%%%o | | /%\%%%%%/%\ /%\%%%%%/%\ | | /%%%\%%%/%%%\ /%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\ /%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o%%%%%%%o%%%%%%%o | | |\%%%%%/ \%%%%%/%\%%%%%/ \%%%%%/| | | | \%%%/ \%%%/%%%\%%%/ \%%%/ | | | | \%/ \%/%%%%%\%/ \%/ | | | | o o%%%%%%%o o | | | | |\ /%\%%%%%/%\ /| | | | | | \ /%%%\%%%/%%%\ / | | | | | u | \ /%%%%%\%/%%%%%\ / | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/ \%%%%%/ | | | | \%%%/ \%%%/ | | | | du \%/ \%/ dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 1.2. Ef = ((u + du)(v + dv))
o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | / \ / \ | | / \ / \ | | / \ / \ | | o o o | | / \ /%\ / \ | | / \ /%%%\ / \ | | / \ /%%%%%\ / \ | | o o%%%%%%%o o | | / \ / \%%%%%/ \ / \ | | / \ / \%%%/ \ / \ | | / \ / \%/ \ / \ | | o o o o o | | |\ /%\ /%\ /%\ /| | | | \ /%%%\ /%%%\ /%%%\ / | | | | \ /%%%%%\ /%%%%%\ /%%%%%\ / | | | | o%%%%%%%o%%%%%%%o%%%%%%%o | | | | |\%%%%%/%\%%%%%/%\%%%%%/| | | | | | \%%%/%%%\%%%/%%%\%%%/ | | | | | u | \%/%%%%%\%/%%%%%\%/ | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/ \%%%%%/ | | | | \%%%/ \%%%/ | | | | du \%/ \%/ dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 1.3. Difference Map Df = f + Ef
o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | / \ / \ | | / \ / \ | | / \ / \ | | o o o | | / \ / \ / \ | | / \ / \ / \ | | / \ / \ / \ | | o o o o | | / \ /%\ /%\ / \ | | / \ /%%%\ /%%%\ / \ | | / \ /%%%%%\ /%%%%%\ / \ | | o o%%%%%%%o%%%%%%%o o | | |\ /%\%%%%%/ \%%%%%/%\ /| | | | \ /%%%\%%%/ \%%%/%%%\ / | | | | \ /%%%%%\%/ \%/%%%%%\ / | | | | o%%%%%%%o o%%%%%%%o | | | | |\%%%%%/%\ /%\%%%%%/| | | | | | \%%%/%%%\ /%%%\%%%/ | | | | | u | \%/%%%%%\ /%%%%%\%/ | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/ \%%%%%/ | | | | \%%%/ \%%%/ | | | | du \%/ \%/ dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 1.4. Linear Proxy df for Df
o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | / \ / \ | | / \ / \ | | / \ / \ | | o o o | | / \ /%\ / \ | | / \ /%%%\ / \ | | / \ /%%%%%\ / \ | | o o%%%%%%%o o | | / \ /%\%%%%%/%\ / \ | | / \ /%%%\%%%/%%%\ / \ | | / \ /%%%%%\%/%%%%%\ / \ | | o o%%%%%%%o%%%%%%%o o | | |\ / \%%%%%/%\%%%%%/ \ /| | | | \ / \%%%/%%%\%%%/ \ / | | | | \ / \%/%%%%%\%/ \ / | | | | o o%%%%%%%o o | | | | |\ / \%%%%%/ \ /| | | | | | \ / \%%%/ \ / | | | | | u | \ / \%/ \ / | v | | | o---+---o o o---+---o | | | \ / \ / | | | | \ / \ / | | | | du \ / \ / dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 1.5. Remainder rf = Df + df
Computation Summary \[g(u, v) = \texttt{((u, v))}\]
Figure 2.1 shows the expansion of \(g = \texttt{((u, v))}\) over \([u, v]\!\) to produce the expression:
| \(\texttt{uv} ~+~ \texttt{(u)(v)}\) |
Figure 2.2 shows the expansion of \(\operatorname{E}g = \texttt{((u + du, v + dv))}\) over \([u, v]\!\) to produce the expression:
| \(\texttt{uv} \cdot \texttt{((du, dv))} + \texttt{u(v)} \cdot \texttt{(du, dv)} + \texttt{(u)v} \cdot \texttt{(du, dv)} + \texttt{(u)(v)} \cdot \texttt{((du, dv))}\) |
\(\operatorname{E}g\) tells you what you would have to do, from where you are in the universe \([u, v],\!\) if you want to end up in a place where \(g\!\) is true. In this case, where the prevailing proposition \(g\!\) is \(\texttt{((u, v))},\) the component \(\texttt{uv} \cdot \texttt{((du, dv))}\) of \(\operatorname{E}g\) tells you this: If \(u\!\) and \(v\!\) are both true where you are, then change either both or neither of \(u\!\) and \(v\!\) at the same time, and you will attain a place where \(\texttt{((du, dv))}\) is true.
Figure 2.3 shows the expansion of \(\operatorname{D}g\) over \([u, v]\!\) to produce the expression:
| \(\texttt{uv} \cdot \texttt{(du, dv)} ~+~ \texttt{u(v)} \cdot \texttt{(du, dv)} ~+~ \texttt{(u)v} \cdot \texttt{(du, dv)} ~+~ \texttt{(u)(v)} \cdot \texttt{(du, dv)}\) |
\(\operatorname{D}g\) tells you what you would have to do, from where you are in the universe \([u, v],\!\) if you want to bring about a change in the value of \(g,\!\) that is, if you want to get to a place where the value of \(g\!\) is different from what it is where you are. In the present case, where the ruling proposition \(g\!\) is \(\texttt{((u, v))},\) the term \(\texttt{uv} \cdot \texttt{(du, dv)}\) of \(\operatorname{D}g\) tells you this: If \(u\!\) and \(v\!\) are both true where you are, then you would have to change one or the other but not both \(u\!\) and \(v\!\) in order to reach a place where the value of \(g\!\) is different from what it is where you are.
Figure 2.4 approximates \(\operatorname{D}g\) by the linear form \(\operatorname{d}g\) that expands over \([u, v]\!\) as follows:
|
\(\begin{array}{lll} \operatorname{d}g & = & \texttt{uv}\!\cdot\!\texttt{(du, dv)} + \texttt{u(v)}\!\cdot\!\texttt{(du, dv)} + \texttt{(u)v}\!\cdot\!\texttt{(du, dv)} + \texttt{(u)(v)}\!\cdot\!\texttt{(du, dv)} \\ \\ & = & \texttt{(du, dv)} \end{array}\) |
Figure 2.5 shows what remains of the difference map \(\operatorname{D}g\) when the first order linear contribution \(\operatorname{d}g\) is removed, namely:
|
\(\begin{matrix} \operatorname{r}g & = & \texttt{uv} \cdot \texttt{0} & + & \texttt{u(v)} \cdot \texttt{0} & + & \texttt{(u)v} \cdot \texttt{0} & + & \texttt{(u)(v)} \cdot \texttt{0} \\ \\ & = & \texttt{0} \end{matrix}\) |
o---------------------------------------o | | | o | | /%\ | | /%%%\ | | /%%%%%\ | | o%%%%%%%o | | /%\%%%%%/%\ | | /%%%\%%%/%%%\ | | /%%%%%\%/%%%%%\ | | o%%%%%%%o%%%%%%%o | | / \%%%%%/%\%%%%%/ \ | | / \%%%/%%%\%%%/ \ | | / \%/%%%%%\%/ \ | | o o%%%%%%%o o | | / \ / \%%%%%/ \ / \ | | / \ / \%%%/ \ / \ | | / \ / \%/ \ / \ | | o o o o o | | |\ / \ /%\ / \ /| | | | \ / \ /%%%\ / \ / | | | | \ / \ /%%%%%\ / \ / | | | | o o%%%%%%%o o | | | | |\ /%\%%%%%/%\ /| | | | | | \ /%%%\%%%/%%%\ / | | | | | u | \ /%%%%%\%/%%%%%\ / | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/%\%%%%%/ | | | | \%%%/%%%\%%%/ | | | | du \%/%%%%%\%/ dv | | | o-------o%%%%%%%o-------o | | \%%%%%/ | | \%%%/ | | \%/ | | o | | | o---------------------------------------o Figure 2.1. g = ((u, v))
o---------------------------------------o | | | o | | /%\ | | /%%%\ | | /%%%%%\ | | o%%%%%%%o | | / \%%%%%/ \ | | / \%%%/ \ | | / \%/ \ | | o o o | | /%\ /%\ /%\ | | /%%%\ /%%%\ /%%%\ | | /%%%%%\ /%%%%%\ /%%%%%\ | | o%%%%%%%o%%%%%%%o%%%%%%%o | | / \%%%%%/ \%%%%%/ \%%%%%/ \ | | / \%%%/ \%%%/ \%%%/ \ | | / \%/ \%/ \%/ \ | | o o o o o | | |\ /%\ /%\ /%\ /| | | | \ /%%%\ /%%%\ /%%%\ / | | | | \ /%%%%%\ /%%%%%\ /%%%%%\ / | | | | o%%%%%%%o%%%%%%%o%%%%%%%o | | | | |\%%%%%/ \%%%%%/ \%%%%%/| | | | | | \%%%/ \%%%/ \%%%/ | | | | | u | \%/ \%/ \%/ | v | | | o---+---o o o---+---o | | | \ /%\ / | | | | \ /%%%\ / | | | | du \ /%%%%%\ / dv | | | o-------o%%%%%%%o-------o | | \%%%%%/ | | \%%%/ | | \%/ | | o | | | o---------------------------------------o Figure 2.2. Eg = ((u + du, v + dv))
o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | /%\ /%\ | | /%%%\ /%%%\ | | /%%%%%\ /%%%%%\ | | o%%%%%%%o%%%%%%%o | | /%\%%%%%/ \%%%%%/%\ | | /%%%\%%%/ \%%%/%%%\ | | /%%%%%\%/ \%/%%%%%\ | | o%%%%%%%o o%%%%%%%o | | / \%%%%%/ \ / \%%%%%/ \ | | / \%%%/ \ / \%%%/ \ | | / \%/ \ / \%/ \ | | o o o o o | | |\ /%\ / \ /%\ /| | | | \ /%%%\ / \ /%%%\ / | | | | \ /%%%%%\ / \ /%%%%%\ / | | | | o%%%%%%%o o%%%%%%%o | | | | |\%%%%%/%\ /%\%%%%%/| | | | | | \%%%/%%%\ /%%%\%%%/ | | | | | u | \%/%%%%%\ /%%%%%\%/ | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/ \%%%%%/ | | | | \%%%/ \%%%/ | | | | du \%/ \%/ dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 2.3. Difference Map Dg = g + Eg
o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | /%\ /%\ | | /%%%\ /%%%\ | | /%%%%%\ /%%%%%\ | | o%%%%%%%o%%%%%%%o | | /%\%%%%%/ \%%%%%/%\ | | /%%%\%%%/ \%%%/%%%\ | | /%%%%%\%/ \%/%%%%%\ | | o%%%%%%%o o%%%%%%%o | | / \%%%%%/ \ / \%%%%%/ \ | | / \%%%/ \ / \%%%/ \ | | / \%/ \ / \%/ \ | | o o o o o | | |\ /%\ / \ /%\ /| | | | \ /%%%\ / \ /%%%\ / | | | | \ /%%%%%\ / \ /%%%%%\ / | | | | o%%%%%%%o o%%%%%%%o | | | | |\%%%%%/%\ /%\%%%%%/| | | | | | \%%%/%%%\ /%%%\%%%/ | | | | | u | \%/%%%%%\ /%%%%%\%/ | v | | | o---+---o%%%%%%%o%%%%%%%o---+---o | | | \%%%%%/ \%%%%%/ | | | | \%%%/ \%%%/ | | | | du \%/ \%/ dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 2.4. Linear Proxy dg for Dg
o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | / \ / \ | | / \ / \ | | / \ / \ | | o o o | | / \ / \ / \ | | / \ / \ / \ | | / \ / \ / \ | | o o o o | | / \ / \ / \ / \ | | / \ / \ / \ / \ | | / \ / \ / \ / \ | | o o o o o | | |\ / \ / \ / \ /| | | | \ / \ / \ / \ / | | | | \ / \ / \ / \ / | | | | o o o o | | | | |\ / \ / \ /| | | | | | \ / \ / \ / | | | | | u | \ / \ / \ / | v | | | o---+---o o o---+---o | | | \ / \ / | | | | \ / \ / | | | | du \ / \ / dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o Figure 2.5. Remainder rg = Dg + dg
| Have I carved enough, my lord -- | Child, you are a bone. | | Leonard Cohen, "Teachers" (1967)
Visualization
In my work on "Differential Logic and Dynamic Systems", I found it useful to develop several different ways of visualizing logical transformations, indeed, I devised four distinct styles of picture for the job. Thus far in our work on the mapping \(F : [u, v] \to [u, v],\!\) we've been making use of what I call the areal view of the extended universe of discourse, \([u, v, du, dv],\!\) but as the number of dimensions climbs beyond four, it's time to bid this genre adieu, and look for a style that can scale a little better. At any rate, before we proceed any further, let's first assemble the information that we have gathered about \(F\!\) from several different angles, and see if it can be fitted into a coherent picture of the transformation \(F : (u, v) \mapsto ( ~\texttt{((u)(v))}~, ~\texttt{((u, v))}~ ).\)
In our first crack at the transformation \(F,\!\) we simply plotted the state transitions and applied the utterly stock technique of calculating the finite differences.
| \(\text{Orbit 1}\!\) |
|
\(\begin{array}{c|cc|cc|} t & u & v & du & dv \'"`UNIQ-MathJax6-QINU`"' Another way to convey the same information is by means of the extended proposition'"`UNIQ-MathJax7-QINU`"' {| align="center" cellpadding="8" style="text-align:center" | \(\text{Orbit 2}\!\) |
|
\(\begin{array}{c|cc|cc|cc|} t & u & v & du & dv & d^2 u & d^2 v \\[8pt] 0 & 0 & 0 & 0 & 1 & 1 & 0 \\ 1 & 0 & 1 & 1 & 1 & 1 & 1 \\ 2 & 1 & 0 & 0 & 0 & 0 & 0 \\ 3 & '' & '' & '' & '' & '' & '' \\ \end{array}\) |
A more fine combing of the second Table brings to mind a rule that partly covers the remaining cases, that is, \(\texttt{du~=~v}, ~\texttt{dv~=~(u)}.\) This much information about Orbit 2 is also encapsulated by the extended proposition, \(\texttt{(uv)((du, v))(dv, u)},\) which says that \(u\!\) and \(v\!\) are not both true at the same time, while \(du\!\) is equal in value to \(v\!\) and \(dv\!\) is opposite in value to \(u.\!\)
Turing Machine Example
By way of providing a simple illustration of Cook's Theorem, namely, that "Propositional Satisfiability is NP-Complete", I will describe one way to translate finite approximations of turing machines into propositional expressions, using the cactus language syntax for propositional calculus that I will describe in more detail as we proceed.
- \(\operatorname{Stilt}(k) =\)
- Space and time limited turing machine,
- with \(k\!\) units of space and \(k\!\) units of time.
- \(\operatorname{Stunt}(k) =\)
- Space and time limited turing machine,
- for computing the parity of a bit string, with number of tape cells of input equal to \(k.\!\)
I will follow the pattern of discussion in Herbert Wilf (1986), Algorithms and Complexity, pp. 188–201, but translate his logical formalism into cactus language, which is more efficient in regard to the number of propositional clauses that are required.
A turing machine for computing the parity of a bit string is described by means of the following Figure and Table.
o-------------------------------------------------o | | | 1/1/+1 | | --------> | | /\ / \ /\ | | 0/0/+1 ^ 0 1 ^ 0/0/+1 | | \/|\ /|\/ | | | <-------- | | | #/#/-1 | 1/1/+1 | #/#/-1 | | | | | | v v | | # * | | | o-------------------------------------------------o Figure 21-a. Parity Machine
Table 21-b. Parity Machine o-------o--------o-------------o---------o------------o | State | Symbol | Next Symbol | Ratchet | Next State | | Q | S | S' | dR | Q' | o-------o--------o-------------o---------o------------o | 0 | 0 | 0 | +1 | 0 | | 0 | 1 | 1 | +1 | 1 | | 0 | # | # | -1 | # | | 1 | 0 | 0 | +1 | 1 | | 1 | 1 | 1 | +1 | 0 | | 1 | # | # | -1 | * | o-------o--------o-------------o---------o------------o
The TM has a finite automaton (FA) as one component. Let us refer to this particular FA by the name of \(\operatorname{M}.\)
The tape head (that is, the read unit) will be called \(\operatorname{H}.\) The registers are also called tape cells or tape squares.
Finite Approximations
To see how each finite approximation to a given turing machine can be given a purely propositional description, one fixes the parameter \(k\!\) and limits the rest of the discussion to describing \(\operatorname{Stilt}(k),\) which is not really a full-fledged TM anymore but just a finite automaton in disguise.
In this example, for the sake of a minimal illustration, we choose \(k = 2,\!\) and discuss \(\operatorname{Stunt}(2).\) Since the zeroth tape cell and the last tape cell are both occupied by the character \(^{\backprime\backprime}\texttt{\#}^{\prime\prime}\) that is used for both the beginning of file \((\operatorname{bof})\) and the end of file \((\operatorname{eof})\) markers, this allows for only one digit of significant computation.
To translate \(\operatorname{Stunt}(2)\) into propositional form we use the following collection of basic propositions, boolean variables, or logical features, depending on what one prefers to call them:
The basic propositions for describing the present state function \(\operatorname{QF} : P \to Q\) are these:
|
\(\begin{matrix} \texttt{p0\_q\#}, & \texttt{p0\_q*}, & \texttt{p0\_q0}, & \texttt{p0\_q1}, \\[6pt] \texttt{p1\_q\#}, & \texttt{p1\_q*}, & \texttt{p1\_q0}, & \texttt{p1\_q1}, \\[6pt] \texttt{p2\_q\#}, & \texttt{p2\_q*}, & \texttt{p2\_q0}, & \texttt{p2\_q1}, \\[6pt] \texttt{p3\_q\#}, & \texttt{p3\_q*}, & \texttt{p3\_q0}, & \texttt{p3\_q1}. \end{matrix}\) |
The proposition of the form \(\texttt{pi\_qj}\) says:
| At the point-in-time \(p_i,\!\) the finite state machine \(\operatorname{M}\) is in the state \(q_j.\!\) |
The basic propositions for describing the present register function \(\operatorname{RF} : P \to R\) are these:
|
\(\begin{matrix} \texttt{p0\_r0}, & \texttt{p0\_r1}, & \texttt{p0\_r2}, & \texttt{p0\_r3}, \\[6pt] \texttt{p1\_r0}, & \texttt{p1\_r1}, & \texttt{p1\_r2}, & \texttt{p1\_r3}, \\[6pt] \texttt{p2\_r0}, & \texttt{p2\_r1}, & \texttt{p2\_r2}, & \texttt{p2\_r3}, \\[6pt] \texttt{p3\_r0}, & \texttt{p3\_r1}, & \texttt{p3\_r2}, & \texttt{p3\_r3}. \end{matrix}\) |
The proposition of the form \(\texttt{pi\_rj}\) says:
| At the point-in-time \(p_i,\!\) the tape head \(\operatorname{H}\) is on the tape cell \(r_j.\!\) |
The basic propositions for describing the present symbol function \(\operatorname{SF} : P \to (R \to S)\) are these:
|
\(\begin{matrix} \texttt{p0\_r0\_s\#}, & \texttt{p0\_r0\_s*}, & \texttt{p0\_r0\_s0}, & \texttt{p0\_r0\_s1}, \\[4pt] \texttt{p0\_r1\_s\#}, & \texttt{p0\_r1\_s*}, & \texttt{p0\_r1\_s0}, & \texttt{p0\_r1\_s1}, \\[4pt] \texttt{p0\_r2\_s\#}, & \texttt{p0\_r2\_s*}, & \texttt{p0\_r2\_s0}, & \texttt{p0\_r2\_s1}, \\[4pt] \texttt{p0\_r3\_s\#}, & \texttt{p0\_r3\_s*}, & \texttt{p0\_r3\_s0}, & \texttt{p0\_r3\_s1}, \\[12pt] \texttt{p1\_r0\_s\#}, & \texttt{p1\_r0\_s*}, & \texttt{p1\_r0\_s0}, & \texttt{p1\_r0\_s1}, \\[4pt] \texttt{p1\_r1\_s\#}, & \texttt{p1\_r1\_s*}, & \texttt{p1\_r1\_s0}, & \texttt{p1\_r1\_s1}, \\[4pt] \texttt{p1\_r2\_s\#}, & \texttt{p1\_r2\_s*}, & \texttt{p1\_r2\_s0}, & \texttt{p1\_r2\_s1}, \\[4pt] \texttt{p1\_r3\_s\#}, & \texttt{p1\_r3\_s*}, & \texttt{p1\_r3\_s0}, & \texttt{p1\_r3\_s1}, \\[12pt] \texttt{p2\_r0\_s\#}, & \texttt{p2\_r0\_s*}, & \texttt{p2\_r0\_s0}, & \texttt{p2\_r0\_s1}, \\[4pt] \texttt{p2\_r1\_s\#}, & \texttt{p2\_r1\_s*}, & \texttt{p2\_r1\_s0}, & \texttt{p2\_r1\_s1}, \\[4pt] \texttt{p2\_r2\_s\#}, & \texttt{p2\_r2\_s*}, & \texttt{p2\_r2\_s0}, & \texttt{p2\_r2\_s1}, \\[4pt] \texttt{p2\_r3\_s\#}, & \texttt{p2\_r3\_s*}, & \texttt{p2\_r3\_s0}, & \texttt{p2\_r3\_s1}, \\[12pt] \texttt{p3\_r0\_s\#}, & \texttt{p3\_r0\_s*}, & \texttt{p3\_r0\_s0}, & \texttt{p3\_r0\_s1}, \\[4pt] \texttt{p3\_r1\_s\#}, & \texttt{p3\_r1\_s*}, & \texttt{p3\_r1\_s0}, & \texttt{p3\_r1\_s1}, \\[4pt] \texttt{p3\_r2\_s\#}, & \texttt{p3\_r2\_s*}, & \texttt{p3\_r2\_s0}, & \texttt{p3\_r2\_s1}, \\[4pt] \texttt{p3\_r3\_s\#}, & \texttt{p3\_r3\_s*}, & \texttt{p3\_r3\_s0}, & \texttt{p3\_r3\_s1}. \end{matrix}\) |
The proposition of the form \(\texttt{pi\_rj\_sk}\) says:
| At the point-in-time \(p_i,\!\) the tape cell \(r_j\!\) bears the mark \(s_k.\!\) |
Initial Conditions
Given but a single free square on the tape, there are just two different sets of initial conditions for \(\operatorname{Stunt}(2),\) the finite approximation to the parity turing machine that we are presently considering.
Initial Conditions for Tape Input "0"
The following conjunction of 5 basic propositions describes the initial conditions when \(\operatorname{Stunt}(2)\) is started with an input of "0" in its free square:
|
\(\begin{array}{l} \texttt{p0\_q0} \\ \\ \texttt{p0\_r1} \\ \\ \texttt{p0\_r0\_s\#} \\ \texttt{p0\_r1\_s0} \\ \texttt{p0\_r2\_s\#} \end{array}\) |
This conjunction of basic propositions may be read as follows:
|
At time \(p_0,\!\) machine \(\operatorname{M}\) is in the state \(q_0,\!\) At time \(p_0,\!\) scanner \(\operatorname{H}\) is reading cell \(r_1,\!\) At time \(p_0,\!\) cell \(r_0\!\) contains the symbol \(\texttt{\#},\) At time \(p_0,\!\) cell \(r_1\!\) contains the symbol \(\texttt{0},\) At time \(p_0,\!\) cell \(r_2\!\) contains the symbol \(\texttt{\#}.\) |
Initial Conditions for Tape Input "1"
The following conjunction of 5 basic propositions describes the initial conditions when \(\operatorname{Stunt}(2)\) is started with an input of "1" in its free square:
|
\(\begin{array}{l} \texttt{p0\_q0} \\ \\ \texttt{p0\_r1} \\ \\ \texttt{p0\_r0\_s\#} \\ \texttt{p0\_r1\_s1} \\ \texttt{p0\_r2\_s\#} \end{array}\) |
This conjunction of basic propositions may be read as follows:
|
At time \(p_0,\!\) machine \(\operatorname{M}\) is in the state \(q_0,\!\) At time \(p_0,\!\) scanner \(\operatorname{H}\) is reading cell \(r_1,\!\) At time \(p_0,\!\) cell \(r_0\!\) contains the symbol \(\texttt{\#},\) At time \(p_0,\!\) cell \(r_1\!\) contains the symbol \(\texttt{1},\) At time \(p_0,\!\) cell \(r_2\!\) contains the symbol \(\texttt{\#}.\) |
Propositional Program
A complete description of \(\operatorname{Stunt}(2)\) in propositional form is obtained by conjoining one of the above choices for initial conditions with all of the following sets of propositions, that serve in effect as a simple type of declarative program, telling us all that we need to know about the anatomy and behavior of the truncated TM in question.
Mediate Conditions
|
\(\begin{array}{l} \texttt{(~p0\_q\#~(~p1\_q\#~))} \\ \texttt{(~p0\_q*~(~p1\_q*~))} \\ \\ \texttt{(~p1\_q\#~(~p2\_q\#~))} \\ \texttt{(~p1\_q*~(~p2\_q*~))} \end{array}\) |
Terminal Conditions
|
\(\begin{array}{l} \texttt{((~p2\_q\#~)(~p2\_q*~))} \end{array}\) |
State Partition
|
\(\begin{array}{l} \texttt{((~p0\_q0~),(~p0\_q1~),(~p0\_q\#~),(~p0\_q*~))} \\ \texttt{((~p1\_q0~),(~p1\_q1~),(~p1\_q\#~),(~p1\_q*~))} \\ \texttt{((~p2\_q0~),(~p2\_q1~),(~p2\_q\#~),(~p2\_q*~))} \end{array}\) |
Register Partition
|
\(\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}\) |
Symbol Partition
|
\(\begin{array}{l} \texttt{((~p0\_r0\_s0~),(~p0\_r0\_s1~),(~p0\_r0\_s\#~))} \\ \texttt{((~p0\_r1\_s0~),(~p0\_r1\_s1~),(~p0\_r1\_s\#~))} \\ \texttt{((~p0\_r2\_s0~),(~p0\_r2\_s1~),(~p0\_r2\_s\#~))} \\ \\ \texttt{((~p1\_r0\_s0~),(~p1\_r0\_s1~),(~p1\_r0\_s\#~))} \\ \texttt{((~p1\_r1\_s0~),(~p1\_r1\_s1~),(~p1\_r1\_s\#~))} \\ \texttt{((~p1\_r2\_s0~),(~p1\_r2\_s1~),(~p1\_r2\_s\#~))} \\ \\ \texttt{((~p2\_r0\_s0~),(~p2\_r0\_s1~),(~p2\_r0\_s\#~))} \\ \texttt{((~p2\_r1\_s0~),(~p2\_r1\_s1~),(~p2\_r1\_s\#~))} \\ \texttt{((~p2\_r2\_s0~),(~p2\_r2\_s1~),(~p2\_r2\_s\#~))} \end{array}\) |
Interaction Conditions
|
\(\begin{array}{l} \texttt{((~p0\_r0~) ~p0\_r0\_s0~ (~p1\_r0\_s0~))} \\ \texttt{((~p0\_r0~) ~p0\_r0\_s1~ (~p1\_r0\_s1~))} \\ \texttt{((~p0\_r0~) ~p0\_r0\_s\#~ (~p1\_r0\_s\#~))} \\ \\ \texttt{((~p0\_r1~) ~p0\_r1\_s0~ (~p1\_r1\_s0~))} \\ \texttt{((~p0\_r1~) ~p0\_r1\_s1~ (~p1\_r1\_s1~))} \\ \texttt{((~p0\_r1~) ~p0\_r1\_s\#~ (~p1\_r1\_s\#~))} \\ \\ \texttt{((~p0\_r2~) ~p0\_r2\_s0~ (~p1\_r2\_s0~))} \\ \texttt{((~p0\_r2~) ~p0\_r2\_s1~ (~p1\_r2\_s1~))} \\ \texttt{((~p0\_r2~) ~p0\_r2\_s\#~ (~p1\_r2\_s\#~))} \\ \\ \texttt{((~p1\_r0~) ~p1\_r0\_s0~ (~p2\_r0\_s0~))} \\ \texttt{((~p1\_r0~) ~p1\_r0\_s1~ (~p2\_r0\_s1~))} \\ \texttt{((~p1\_r0~) ~p1\_r0\_s\#~ (~p2\_r0\_s\#~))} \\ \\ \texttt{((~p1\_r1~) ~p1\_r1\_s0~ (~p2\_r1\_s0~))} \\ \texttt{((~p1\_r1~) ~p1\_r1\_s1~ (~p2\_r1\_s1~))} \\ \texttt{((~p1\_r1~) ~p1\_r1\_s\#~ (~p2\_r1\_s\#~))} \\ \\ \texttt{((~p1\_r2~) ~p1\_r2\_s0~ (~p2\_r2\_s0~))} \\ \texttt{((~p1\_r2~) ~p1\_r2\_s1~ (~p2\_r2\_s1~))} \\ \texttt{((~p1\_r2~) ~p1\_r2\_s\#~ (~p2\_r2\_s\#~))} \end{array}\) |
Transition Relations
|
\(\begin{array}{l} \texttt{(~p0\_q0~~p0\_r1~~p0\_r1\_s0~~(~p1\_q0~~p1\_r2~~p1\_r1\_s0~))} \\ \texttt{(~p0\_q0~~p0\_r1~~p0\_r1\_s1~~(~p1\_q1~~p1\_r2~~p1\_r1\_s1~))} \\ \texttt{(~p0\_q0~~p0\_r1~~p0\_r1\_s\#~~(~p1\_q\#~~p1\_r0~~p1\_r1\_s\#~))} \\ \texttt{(~p0\_q0~~p0\_r2~~p0\_r2\_s\#~~(~p1\_q\#~~p1\_r1~~p1\_r2\_s\#~))} \\ \\ \texttt{(~p0\_q1~~p0\_r1~~p0\_r1\_s0~~(~p1\_q1~~p1\_r2~~p1\_r1\_s0~))} \\ \texttt{(~p0\_q1~~p0\_r1~~p0\_r1\_s1~~(~p1\_q0~~p1\_r2~~p1\_r1\_s1~))} \\ \texttt{(~p0\_q1~~p0\_r1~~p0\_r1\_s\#~~(~p1\_q*~~p1\_r0~~p1\_r1\_s\#~))} \\ \texttt{(~p0\_q1~~p0\_r2~~p0\_r2\_s\#~~(~p1\_q*~~p1\_r1~~p1\_r2\_s\#~))} \\ \\ \texttt{(~p1\_q0~~p1\_r1~~p1\_r1\_s0~~(~p2\_q0~~p2\_r2~~p2\_r1\_s0~))} \\ \texttt{(~p1\_q0~~p1\_r1~~p1\_r1\_s1~~(~p2\_q1~~p2\_r2~~p2\_r1\_s1~))} \\ \texttt{(~p1\_q0~~p1\_r1~~p1\_r1\_s\#~~(~p2\_q\#~~p2\_r0~~p2\_r1\_s\#~))} \\ \texttt{(~p1\_q0~~p1\_r2~~p1\_r2\_s\#~~(~p2\_q\#~~p2\_r1~~p2\_r2\_s\#~))} \\ \\ \texttt{(~p1\_q1~~p1\_r1~~p1\_r1\_s0~~(~p2\_q1~~p2\_r2~~p2\_r1\_s0~))} \\ \texttt{(~p1\_q1~~p1\_r1~~p1\_r1\_s1~~(~p2\_q0~~p2\_r2~~p2\_r1\_s1~))} \\ \texttt{(~p1\_q1~~p1\_r1~~p1\_r1\_s\#~~(~p2\_q*~~p2\_r0~~p2\_r1\_s\#~))} \\ \texttt{(~p1\_q1~~p1\_r2~~p1\_r2\_s\#~~(~p2\_q*~~p2\_r1~~p2\_r2\_s\#~))} \end{array}\) |
Interpretation of the Propositional Program
Let us now run through the propositional specification of \(\operatorname{Stunt}(2),\) our truncated TM, and paraphrase what it says in ordinary language.
Mediate Conditions
|
\(\begin{array}{l} \texttt{(~p0\_q\#~(~p1\_q\#~))} \\ \texttt{(~p0\_q*~(~p1\_q*~))} \\ \\ \texttt{(~p1\_q\#~(~p2\_q\#~))} \\ \texttt{(~p1\_q*~(~p2\_q*~))} \end{array}\) |
In the interpretation of the cactus language for propositional logic that we are using here, an expression of the form \(\texttt{(p(q))}\) expresses a conditional, an implication, or an if-then proposition, commonly read in one of the following ways:
|
\(\begin{array}{l} \operatorname{not}~ p ~\operatorname{without}~ q \\[4pt] p ~\operatorname{implies}~ q \\[4pt] \operatorname{if}~ p ~\operatorname{then}~ q \\[4pt] p \Rightarrow q \end{array}\) |
A text string expression of the form \(\texttt{(p(q))}\) corresponds to a graph-theoretic data-structure of the following form:
o---------------------------------------o | | | p q | | o---o | | | | | @ | | | o---------------------------------------o | ( p ( q )) | o---------------------------------------o
Taken together, the Mediate Conditions state the following:
|
If \(\operatorname{M}\) at \(p_0\!\) is in state \(q_\#,\!\) then \(\operatorname{M}\) at \(p_1\!\) is in state \(q_\#,\!\) and If \(\operatorname{M}\) at \(p_0\!\) is in state \(q_*,\!\) then \(\operatorname{M}\) at \(p_1\!\) is in state \(q_*,\!\) and If \(\operatorname{M}\) at \(p_1\!\) is in state \(q_\#,\!\) then \(\operatorname{M}\) at \(p_2\!\) is in state \(q_\#,\!\) and If \(\operatorname{M}\) at \(p_1\!\) is in state \(q_*,\!\) then \(\operatorname{M}\) at \(p_2\!\) is in state \(q_*.\!\) |
Terminal Conditions
|
\(\begin{array}{l} \texttt{((~p2\_q\#~)(~p2\_q*~))} \end{array}\) |
In cactus syntax, an expression of the form \(\texttt{((p)(q))}\) expresses the disjunction \(p ~\operatorname{or}~ q.\) The corresponding cactus graph, here just a tree, has the following shape:
o---------------------------------------o | | | p q | | o o | | \ / | | o | | | | | @ | | | o---------------------------------------o | ((p) (q)) | o---------------------------------------o
In effect, the Terminal Conditions state the following:
|
At time \(p_2\!\) machine \(\operatorname{M}\) is in state \(q_\#,\!\) or At time \(p_2\!\) machine \(\operatorname{M}\) is in state \(q_*.\!\) |
State Partition
|
\(\begin{array}{l} \texttt{((~p0\_q0~),(~p0\_q1~),(~p0\_q\#~),(~p0\_q*~))} \\ \texttt{((~p1\_q0~),(~p1\_q1~),(~p1\_q\#~),(~p1\_q*~))} \\ \texttt{((~p2\_q0~),(~p2\_q1~),(~p2\_q\#~),(~p2\_q*~))} \end{array}\) |
In cactus syntax, an expression of the form \(\texttt{((} e_1 \texttt{),(} e_2 \texttt{),(} \ldots \texttt{),(} e_k \texttt{))}\) expresses a statement to the effect that exactly one of the expressions \(e_j\!\) is true, for \(j = 1 ~\mathit{to}~ k.\) Expressions of this form are called universal partition expressions, and the corresponding painted and rooted cactus (PARC) has the following shape:
o---------------------------------------o | | | e_1 e_2 ... e_k | | o o o | | | | | | | o-----o--- ... ---o | | \ / | | \ / | | \ / | | \ / | | \ / | | \ / | | \ / | | \ / | | @ | | | o---------------------------------------o | ((e_1),(e_2),(...),(e_k)) | o---------------------------------------o
The State Partition segment of the propositional program consists of three universal partition expressions, taken in conjunction expressing the condition that \(\operatorname{M}\) has to be in one and only one of its states at each point in time under consideration. In short, we have the constraint:
|
At each of the points in time \(p_i,\!\) for \(i\!\) in the set \(\{ 0, 1, 2 \},\!\) \(\operatorname{M}\) can be in exactly one state \(q_j,\!\) for \(j\!\) in the set \(\{ 0, 1, \#, * \}.\) |
Register Partition
|
\(\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}\) |
The Register Partition segment of the propositional program consists of three universal partition expressions, taken in conjunction saying that the read head \(\operatorname{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,\!\) \(\operatorname{H}\) is reading exactly one cell \(r_j,\!\) for \(j = 0, 1, 2.\!\) |
Symbol Partition
|
\(\begin{array}{l} \texttt{((~p0\_r0\_s0~),(~p0\_r0\_s1~),(~p0\_r0\_s\#~))} \\ \texttt{((~p0\_r1\_s0~),(~p0\_r1\_s1~),(~p0\_r1\_s\#~))} \\ \texttt{((~p0\_r2\_s0~),(~p0\_r2\_s1~),(~p0\_r2\_s\#~))} \\ \\ \texttt{((~p1\_r0\_s0~),(~p1\_r0\_s1~),(~p1\_r0\_s\#~))} \\ \texttt{((~p1\_r1\_s0~),(~p1\_r1\_s1~),(~p1\_r1\_s\#~))} \\ \texttt{((~p1\_r2\_s0~),(~p1\_r2\_s1~),(~p1\_r2\_s\#~))} \\ \\ \texttt{((~p2\_r0\_s0~),(~p2\_r0\_s1~),(~p2\_r0\_s\#~))} \\ \texttt{((~p2\_r1\_s0~),(~p2\_r1\_s1~),(~p2\_r1\_s\#~))} \\ \texttt{((~p2\_r2\_s0~),(~p2\_r2\_s1~),(~p2\_r2\_s\#~))} \end{array}\) |
The Symbol Partition segment of the propositional program for \(\operatorname{Stunt}(2)\) consists of nine universal partition expressions, taken in conjunction stipulating that there has to be one and only one symbol in each of the registers at each point in time under consideration. In short, we have:
|
At each of the points in time \(p_i,\!\) for \(i\!\) in \(\{ 0, 1, 2 \},\!\) in each of the tape registers \(r_j,\!\) for \(j\!\) in \(\{ 0, 1, 2 \},\!\) there can be exactly one sign \(s_k,\!\) for \(k\!\) in \(\{ 0, 1, \# \}.\!\) |
Interaction Conditions
|
\(\begin{array}{l} \texttt{((~p0\_r0~) ~p0\_r0\_s0~ (~p1\_r0\_s0~))} \\ \texttt{((~p0\_r0~) ~p0\_r0\_s1~ (~p1\_r0\_s1~))} \\ \texttt{((~p0\_r0~) ~p0\_r0\_s\#~ (~p1\_r0\_s\#~))} \\ \\ \texttt{((~p0\_r1~) ~p0\_r1\_s0~ (~p1\_r1\_s0~))} \\ \texttt{((~p0\_r1~) ~p0\_r1\_s1~ (~p1\_r1\_s1~))} \\ \texttt{((~p0\_r1~) ~p0\_r1\_s\#~ (~p1\_r1\_s\#~))} \\ \\ \texttt{((~p0\_r2~) ~p0\_r2\_s0~ (~p1\_r2\_s0~))} \\ \texttt{((~p0\_r2~) ~p0\_r2\_s1~ (~p1\_r2\_s1~))} \\ \texttt{((~p0\_r2~) ~p0\_r2\_s\#~ (~p1\_r2\_s\#~))} \\ \\ \texttt{((~p1\_r0~) ~p1\_r0\_s0~ (~p2\_r0\_s0~))} \\ \texttt{((~p1\_r0~) ~p1\_r0\_s1~ (~p2\_r0\_s1~))} \\ \texttt{((~p1\_r0~) ~p1\_r0\_s\#~ (~p2\_r0\_s\#~))} \\ \\ \texttt{((~p1\_r1~) ~p1\_r1\_s0~ (~p2\_r1\_s0~))} \\ \texttt{((~p1\_r1~) ~p1\_r1\_s1~ (~p2\_r1\_s1~))} \\ \texttt{((~p1\_r1~) ~p1\_r1\_s\#~ (~p2\_r1\_s\#~))} \\ \\ \texttt{((~p1\_r2~) ~p1\_r2\_s0~ (~p2\_r2\_s0~))} \\ \texttt{((~p1\_r2~) ~p1\_r2\_s1~ (~p2\_r2\_s1~))} \\ \texttt{((~p1\_r2~) ~p1\_r2\_s\#~ (~p2\_r2\_s\#~))} \end{array}\) |
In briefest terms, the Interaction Conditions simply express the circumstance that the mark on a tape cell cannot change between two points in time unless the tape head is over the cell in question at the initial one of those points in time. All that we have to do is to see how they manage to say this.
Consider a cactus expression of the following form:
|
\(\begin{array}{l} \texttt{((}~ p_i\_r_j ~\texttt{)}~ p_i\_r_j\_s_k ~\texttt{(}~ p_{i+1}\_r_j\_s_k ~\texttt{))} \end{array}\) |
This expression has the corresponding cactus graph:
o---------------------------------------o | | | p<i>_r<j> p<i+1>_r<j>_s<k> | | o o | | \ / | | p<i>_r<j>_s<k> o | | | | | @ | | | o---------------------------------------o
A propositional expression of this form can be read as follows:
| \(\operatorname{If}\) |
| At the time \(p_i,\!\) the tape cell \(r_j\!\) bears the mark \(s_k,\!\) |
| \(\operatorname{But}\) it is not the case that: |
| At the time \(p_i,\!\) the tape head is on the tape cell \(r_j,\!\) |
| \(\operatorname{Then}\) |
| At the time \(p_{i+1},\!\) the tape cell \(r_j\!\) bears the mark \(s_k.\!\) |
The eighteen clauses of the Interaction Conditions simply impose one such constraint on symbol changes for each combination of the times \(p_0, p_1,\!\) registers \(r_0, r_1, r_2,\!\) and symbols \(s_0, s_1, s_\#.\!\)
Transition Relations
|
\(\begin{array}{l} \texttt{(~p0\_q0~~p0\_r1~~p0\_r1\_s0~~(~p1\_q0~~p1\_r2~~p1\_r1\_s0~))} \\ \texttt{(~p0\_q0~~p0\_r1~~p0\_r1\_s1~~(~p1\_q1~~p1\_r2~~p1\_r1\_s1~))} \\ \texttt{(~p0\_q0~~p0\_r1~~p0\_r1\_s\#~~(~p1\_q\#~~p1\_r0~~p1\_r1\_s\#~))} \\ \texttt{(~p0\_q0~~p0\_r2~~p0\_r2\_s\#~~(~p1\_q\#~~p1\_r1~~p1\_r2\_s\#~))} \\ \\ \texttt{(~p0\_q1~~p0\_r1~~p0\_r1\_s0~~(~p1\_q1~~p1\_r2~~p1\_r1\_s0~))} \\ \texttt{(~p0\_q1~~p0\_r1~~p0\_r1\_s1~~(~p1\_q0~~p1\_r2~~p1\_r1\_s1~))} \\ \texttt{(~p0\_q1~~p0\_r1~~p0\_r1\_s\#~~(~p1\_q*~~p1\_r0~~p1\_r1\_s\#~))} \\ \texttt{(~p0\_q1~~p0\_r2~~p0\_r2\_s\#~~(~p1\_q*~~p1\_r1~~p1\_r2\_s\#~))} \\ \\ \texttt{(~p1\_q0~~p1\_r1~~p1\_r1\_s0~~(~p2\_q0~~p2\_r2~~p2\_r1\_s0~))} \\ \texttt{(~p1\_q0~~p1\_r1~~p1\_r1\_s1~~(~p2\_q1~~p2\_r2~~p2\_r1\_s1~))} \\ \texttt{(~p1\_q0~~p1\_r1~~p1\_r1\_s\#~~(~p2\_q\#~~p2\_r0~~p2\_r1\_s\#~))} \\ \texttt{(~p1\_q0~~p1\_r2~~p1\_r2\_s\#~~(~p2\_q\#~~p2\_r1~~p2\_r2\_s\#~))} \\ \\ \texttt{(~p1\_q1~~p1\_r1~~p1\_r1\_s0~~(~p2\_q1~~p2\_r2~~p2\_r1\_s0~))} \\ \texttt{(~p1\_q1~~p1\_r1~~p1\_r1\_s1~~(~p2\_q0~~p2\_r2~~p2\_r1\_s1~))} \\ \texttt{(~p1\_q1~~p1\_r1~~p1\_r1\_s\#~~(~p2\_q*~~p2\_r0~~p2\_r1\_s\#~))} \\ \texttt{(~p1\_q1~~p1\_r2~~p1\_r2\_s\#~~(~p2\_q*~~p2\_r1~~p2\_r2\_s\#~))} \end{array}\) |
The Transition Relation segment of the propositional program for \(\operatorname{Stunt}(2)\) 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:
| \(\texttt{(~p0\_q0~~p0\_r1~~p0\_r1\_s1~~(~p1\_q1~~p1\_r2~~p1\_r1\_s1~))}\) |
This complex implication statement can be read to say:
| \(\operatorname{If}\) |
| At the time \(p_0,\!\) the machine \(\operatorname{M}\) is in the state \(q_0,\!\) and |
| At the time \(p_0,\!\) the scanner \(\operatorname{H}\) is reading cell \(r_1,\!\) and |
| At the time \(p_0,\!\) the tape cell \(r_1\!\) contains a \(\texttt{1},\) |
| \(\operatorname{Then}\) |
| At the time \(p_1,\!\) the machine \(\operatorname{M}\) is in the state \(q_1,\!\) and |
| At the time \(p_1,\!\) the scanner \(\operatorname{H}\) is reading cell \(r_2,\!\) and |
| At the time \(p_1,\!\) the tape cell \(r_1\!\) contains a \(\texttt{1}.\) |
Computation
The propositional program for \(\operatorname{Stunt}(2)\) uses the following set of \(9 + 12 + 36 = 57\!\) basic propositions or boolean variables:
|
\(\begin{matrix} \texttt{p0\_r0}, & \texttt{p0\_r1}, & \texttt{p0\_r2}, \\[6pt] \texttt{p1\_r0}, & \texttt{p1\_r1}, & \texttt{p1\_r2}, \\[6pt] \texttt{p2\_r0}, & \texttt{p2\_r1}, & \texttt{p2\_r2}. \end{matrix}\) |
|
\(\begin{matrix} \texttt{p0\_q\#}, & \texttt{p0\_q*}, & \texttt{p0\_q0}, & \texttt{p0\_q1}, \\[6pt] \texttt{p1\_q\#}, & \texttt{p1\_q*}, & \texttt{p1\_q0}, & \texttt{p1\_q1}, \\[6pt] \texttt{p2\_q\#}, & \texttt{p2\_q*}, & \texttt{p2\_q0}, & \texttt{p2\_q1}. \end{matrix}\) |
|
\(\begin{matrix} \texttt{p0\_r0\_s\#}, & \texttt{p0\_r0\_s*}, & \texttt{p0\_r0\_s0}, & \texttt{p0\_r0\_s1}, \\[4pt] \texttt{p0\_r1\_s\#}, & \texttt{p0\_r1\_s*}, & \texttt{p0\_r1\_s0}, & \texttt{p0\_r1\_s1}, \\[4pt] \texttt{p0\_r2\_s\#}, & \texttt{p0\_r2\_s*}, & \texttt{p0\_r2\_s0}, & \texttt{p0\_r2\_s1}, \\[12pt] \texttt{p1\_r0\_s\#}, & \texttt{p1\_r0\_s*}, & \texttt{p1\_r0\_s0}, & \texttt{p1\_r0\_s1}, \\[4pt] \texttt{p1\_r1\_s\#}, & \texttt{p1\_r1\_s*}, & \texttt{p1\_r1\_s0}, & \texttt{p1\_r1\_s1}, \\[4pt] \texttt{p1\_r2\_s\#}, & \texttt{p1\_r2\_s*}, & \texttt{p1\_r2\_s0}, & \texttt{p1\_r2\_s1}, \\[12pt] \texttt{p2\_r0\_s\#}, & \texttt{p2\_r0\_s*}, & \texttt{p2\_r0\_s0}, & \texttt{p2\_r0\_s1}, \\[4pt] \texttt{p2\_r1\_s\#}, & \texttt{p2\_r1\_s*}, & \texttt{p2\_r1\_s0}, & \texttt{p2\_r1\_s1}, \\[4pt] \texttt{p2\_r2\_s\#}, & \texttt{p2\_r2\_s*}, & \texttt{p2\_r2\_s0}, & \texttt{p2\_r2\_s1}. \end{matrix}\) |
This means that the propositional program itself is nothing but a single proposition or boolean function of the form \(p : \mathbb{B}^{57} \to \mathbb{B}.\)
An assignment of boolean values to the above set of boolean variables is called an interpretation of the proposition \(p,\!\) and any interpretation of \(p\!\) that makes the proposition \(p : \mathbb{B}^{57} \to \mathbb{B}\) evaluate to \(1\!\) is referred to as a satisfying interpretation of the proposition \(p.\!\) Another way to specify interpretations, instead of giving them as bit vectors in \(\mathbb{B}^{57}\) and trying to remember some arbitrary ordering of variables, is to give them in the form of singular propositions, that is, a conjunction of the form \(e_1 \cdot \ldots \cdot e_{57}\) where each \(e_j\!\) is either \(v_j\!\) or \(\texttt{(} v_j \texttt{)},\) that is, either the assertion or the negation of the boolean variable \(v_j,\!\) as \(j\!\) runs from 1 to 57. Even more briefly, the same information can be communicated simply by giving the conjunction of the asserted variables, with the understanding that each of the others is negated.
A satisfying interpretation of the proposition \(p\!\) supplies us with all the information of a complete execution history for the corresponding program, and so all we have to do in order to get the output of the program \(p\!\) is to read off the proper part of the data from the expression of this interpretation.
Output
One component of the \(\begin{smallmatrix}\operatorname{Theme~One}\end{smallmatrix}\) program that I wrote some years ago finds all the satisfying interpretations of propositions expressed in cactus syntax. It's not a polynomial time algorithm, as you may guess, but it was just barely efficient enough to do this example in the 500 K of spare memory that I had on an old 286 PC in about 1989, so I will give you the actual outputs from those trials.
Output Conditions for Tape Input "0"
Let \(p_0\!\) be the proposition that we get by conjoining the proposition that describes the initial conditions for tape input "0" with the proposition that describes the truncated turing machine \(\operatorname{Stunt}(2).\) As it turns out, \(p_0\!\) has a single satisfying interpretation. This interpretation is expressible in the form of a singular proposition, which can in turn be indicated by its positive logical features, as shown in the following display:
o-------------------------------------------------o | | | p0_q0 | | p0_r1 | | p0_r0_s# | | p0_r1_s0 | | p0_r2_s# | | p1_q0 | | p1_r2 | | p1_r2_s# | | p1_r0_s# | | p1_r1_s0 | | p2_q# | | p2_r1 | | p2_r0_s# | | p2_r1_s0 | | p2_r2_s# | | | o-------------------------------------------------o
The Output Conditions for Tape Input "0" can be read as follows:
|
At the time \(p_0,\!\) machine \(\operatorname{M}\) is in the state \(q_0,\!\) and At the time \(p_0,\!\) scanner \(\operatorname{H}\) is reading cell \(r_1,\!\) and At the time \(p_0,\!\) cell \(r_0\!\) contains the symbol \(\texttt{\#},\) and At the time \(p_0,\!\) cell \(r_1\!\) contains the symbol \(\texttt{0},\) and At the time \(p_0,\!\) cell \(r_2\!\) contains the symbol \(\texttt{\#},\) and |
|
At the time \(p_1,\!\) machine \(\operatorname{M}\) is in the state \(q_0,\!\) and At the time \(p_1,\!\) scanner \(\operatorname{H}\) is reading cell \(r_2,\!\) and At the time \(p_1,\!\) cell \(r_0\!\) contains the symbol \(\texttt{\#},\) and At the time \(p_1,\!\) cell \(r_1\!\) contains the symbol \(\texttt{0},\) and At the time \(p_1,\!\) cell \(r_2\!\) contains the symbol \(\texttt{\#},\) and |
|
At the time \(p_2,\!\) machine \(\operatorname{M}\) is in the state \(q_\#,\!\) and At the time \(p_2,\!\) scanner \(\operatorname{H}\) is reading cell \(r_1,\!\) and At the time \(p_2,\!\) cell \(r_0\!\) contains the symbol \(\texttt{\#},\) and At the time \(p_2,\!\) cell \(r_1\!\) contains the symbol \(\texttt{0},\) and At the time \(p_2,\!\) cell \(r_2\!\) contains the symbol \(\texttt{\#}.\) |
The output of \(\operatorname{Stunt}(2)\) being the symbol that rests under the tape head \(\operatorname{H}\) if and when the machine \(\operatorname{M}\) reaches one of its resting states, we get the result that \(\operatorname{Parity}(0) = 0.\)
Output Conditions for Tape Input "1"
Let \(p_1\!\) be the proposition that we get by conjoining the proposition that describes the initial conditions for tape input "1" with the proposition that describes the truncated turing machine \(\operatorname{Stunt}(2).\) As it turns out, \(p_1\!\) has a single satisfying interpretation. This interpretation is expressible in the form of a singular proposition, which can in turn be indicated by its positive logical features, as shown in the following display:
o-------------------------------------------------o | | | p0_q0 | | p0_r1 | | p0_r0_s# | | p0_r1_s1 | | p0_r2_s# | | p1_q1 | | p1_r2 | | p1_r2_s# | | p1_r0_s# | | p1_r1_s1 | | p2_q* | | p2_r1 | | p2_r0_s# | | p2_r1_s1 | | p2_r2_s# | | | o-------------------------------------------------o
The Output Conditions for Tape Input "1" can be read as follows:
|
At the time \(p_0,\!\) machine \(\operatorname{M}\) is in the state \(q_0,\!\) and At the time \(p_0,\!\) scanner \(\operatorname{H}\) is reading cell \(r_1,\!\) and At the time \(p_0,\!\) cell \(r_0\!\) contains the symbol \(\texttt{\#},\) and At the time \(p_0,\!\) cell \(r_1\!\) contains the symbol \(\texttt{1},\) and At the time \(p_0,\!\) cell \(r_2\!\) contains the symbol \(\texttt{\#},\) and |
|
At the time \(p_1,\!\) machine \(\operatorname{M}\) is in the state \(q_1,\!\) and At the time \(p_1,\!\) scanner \(\operatorname{H}\) is reading cell \(r_2,\!\) and At the time \(p_1,\!\) cell \(r_0\!\) contains the symbol \(\texttt{\#},\) and At the time \(p_1,\!\) cell \(r_1\!\) contains the symbol \(\texttt{1},\) and At the time \(p_1,\!\) cell \(r_2\!\) contains the symbol \(\texttt{\#},\) and |
|
At the time \(p_2,\!\) machine \(\operatorname{M}\) is in the state \(q_*,\!\) and At the time \(p_2,\!\) scanner \(\operatorname{H}\) is reading cell \(r_1,\!\) and At the time \(p_2,\!\) cell \(r_0\!\) contains the symbol \(\texttt{\#},\) and At the time \(p_2,\!\) cell \(r_1\!\) contains the symbol \(\texttt{1},\) and At the time \(p_2,\!\) cell \(r_2\!\) contains the symbol \(\texttt{\#}.\) |
The output of \(\operatorname{Stunt}(2)\) being the symbol that rests under the tape head \(\operatorname{H}\) when and if the machine \(\operatorname{M}\) reaches one of its resting states, we get the result that \(\operatorname{Parity}(1) = 1.\)
Work Area
DATA 20. http://forum.wolframscience.com/showthread.php?postid=791#post791 Let's see how this information about the transformation F, arrived at by eyeballing the raw data, comports with what we derived through a more systematic symbolic computation. The results of the various operator actions that we have just computed are summarized in Tables 66-i and 66-ii from my paper, and I have attached these as a text file below. Table 66-i. Computation Summary for f<u, v> = ((u)(v)) o--------------------------------------------------------------------------------o | | | !e!f = uv. 1 + u(v). 1 + (u)v. 1 + (u)(v). 0 | | | | Ef = uv. (du dv) + u(v). (du (dv)) + (u)v.((du) dv) + (u)(v).((du)(dv)) | | | | Df = uv. du dv + u(v). du (dv) + (u)v. (du) dv + (u)(v).((du)(dv)) | | | | df = uv. 0 + u(v). du + (u)v. dv + (u)(v). (du, dv) | | | | rf = uv. du dv + u(v). du dv + (u)v. du dv + (u)(v). du dv | | | o--------------------------------------------------------------------------------o Table 66-ii. Computation Summary for g<u, v> = ((u, v)) o--------------------------------------------------------------------------------o | | | !e!g = uv. 1 + u(v). 0 + (u)v. 0 + (u)(v). 1 | | | | Eg = uv.((du, dv)) + u(v). (du, dv) + (u)v. (du, dv) + (u)(v).((du, dv)) | | | | Dg = uv. (du, dv) + u(v). (du, dv) + (u)v. (du, dv) + (u)(v). (du, dv) | | | | dg = uv. (du, dv) + u(v). (du, dv) + (u)v. (du, dv) + (u)(v). (du, dv) | | | | rg = uv. 0 + u(v). 0 + (u)v. 0 + (u)(v). 0 | | | o--------------------------------------------------------------------------------o o---------------------------------------o | | | o | | / \ | | / \ | | / \ | | o o | | / \ / \ | | / \ / \ | | / \ / \ | | o o o | | / \ / \ / \ | | / \ / \ / \ | | / \ / \ / \ | | o o o o | | / \ / \ / \ / \ | | / \ / \ / \ / \ | | / \ / \ / \ / \ | | o o o o o | | |\ / \ / \ / \ /| | | | \ / \ / \ / \ / | | | | \ / \ / \ / \ / | | | | o o o o | | | | |\ / \ / \ /| | | | | | \ / \ / \ / | | | | | u | \ / \ / \ / | v | | | o---+---o o o---+---o | | | \ / \ / | | | | \ / \ / | | | | du \ / \ / dv | | | o-------o o-------o | | \ / | | \ / | | \ / | | o | | | o---------------------------------------o
Discussion
PD = Philip Dutton
PD: I've been watching your posts.
PD: I am not an expert on logic infrastructures but I find the posts
interesting (despite not understanding much of it). I am like
the diagrams. I have recently been trying to understand CA's
using a particular perspective: sinks and sources. I think
that all CA's are simply combinations of sinks and sources.
How they interact (or intrude into each other's domains)
would most likely be a result of the rules (and initial
configuration of on or off cells).
PD: Anyway, to be short, I "see" diamond shapes quite often in
your diagrams. Triangles (either up or down) or diamonds
(combination of an up and down triangle) make me think
soley of sinks and sources. I think of the diamond to
be a source which, during the course of progression,
is expanding (because it is producing) and then starts
to act as a sink (because it consumes) -- and hence the
diamond. I can't stop thinking about sinks and sources in
CA's and so I thought I would ask you if there is some way
to tie the two worlds together (CA's of sinks and sources
together with your differential constructs).
PD: Any thoughts?
Yes, I'm hoping that there's a lot of stuff analogous to
R-world dynamics to be discovered in this B-world variety,
indeed, that's kind of why I set out on this investigation --
oh, gee, has it been that long? -- I guess about 1989 or so,
when I started to see this "differential logic" angle on what
I had previously studied in systems theory as the "qualitative
approach to differential equations". I think we used to use the
words "attractor" and "basin" more often than "sink", but a source
is still a source as time goes by, and I do remember using the word
"sink" a lot when I was a freshperson in physics, before I got logic.
I have spent the last 15 years doing a funny mix of practice in stats
and theory in math, but I did read early works by Von Neumann, Burks,
Ulam, and later stuff by Holland on CA's. Still, it may be a while
before I have re-heated my concrete intuitions about them in the
NKS way of thinking.
There are some fractal-looking pictures that emerge when
I turn to "higher order propositional expressions" (HOPE's).
I have discussed this topic elswhere on the web and can look
it up now if your are interested, but I am trying to make my
e-positions somewhat clearer for the NKS forum than I have
tried to do before.
But do not hestitate to dialogue all this stuff on the boards,
as that's what always seems to work the best. What I've found
works best for me, as I can hardly remember what I was writing
last month without Google, is to archive a copy at one of the
other Google-visible discussion lists that I'm on at present.
Document History
Ontology List : Feb–Mar 2004
- http://suo.ieee.org/ontology/msg05457.html
- http://suo.ieee.org/ontology/msg05458.html
- http://suo.ieee.org/ontology/msg05459.html
- http://suo.ieee.org/ontology/msg05460.html
- http://suo.ieee.org/ontology/msg05461.html
- http://suo.ieee.org/ontology/msg05462.html
- http://suo.ieee.org/ontology/msg05463.html
- http://suo.ieee.org/ontology/msg05464.html
- http://suo.ieee.org/ontology/msg05465.html
- http://suo.ieee.org/ontology/msg05466.html
- http://suo.ieee.org/ontology/msg05467.html
- http://suo.ieee.org/ontology/msg05469.html
- http://suo.ieee.org/ontology/msg05470.html
- http://suo.ieee.org/ontology/msg05471.html
- http://suo.ieee.org/ontology/msg05472.html
- http://suo.ieee.org/ontology/msg05473.html
- http://suo.ieee.org/ontology/msg05474.html
- http://suo.ieee.org/ontology/msg05475.html
- http://suo.ieee.org/ontology/msg05476.html
- http://suo.ieee.org/ontology/msg05479.html
NKS Forum : Feb–Jun 2004
- http://forum.wolframscience.com/archive/topic/228-1.html
- http://forum.wolframscience.com/showthread.php?threadid=228
- http://forum.wolframscience.com/printthread.php?threadid=228&perpage=33
- http://forum.wolframscience.com/showthread.php?postid=664#post664
- http://forum.wolframscience.com/showthread.php?postid=666#post666
- http://forum.wolframscience.com/showthread.php?postid=677#post677
- http://forum.wolframscience.com/showthread.php?postid=684#post684
- http://forum.wolframscience.com/showthread.php?postid=689#post689
- http://forum.wolframscience.com/showthread.php?postid=697#post697
- http://forum.wolframscience.com/showthread.php?postid=708#post708
- http://forum.wolframscience.com/showthread.php?postid=721#post721
- http://forum.wolframscience.com/showthread.php?postid=722#post722
- http://forum.wolframscience.com/showthread.php?postid=725#post725
- http://forum.wolframscience.com/showthread.php?postid=733#post733
- http://forum.wolframscience.com/showthread.php?postid=756#post756
- http://forum.wolframscience.com/showthread.php?postid=759#post759
- http://forum.wolframscience.com/showthread.php?postid=764#post764
- http://forum.wolframscience.com/showthread.php?postid=766#post766
- http://forum.wolframscience.com/showthread.php?postid=767#post767
- http://forum.wolframscience.com/showthread.php?postid=773#post773
- http://forum.wolframscience.com/showthread.php?postid=775#post775
- http://forum.wolframscience.com/showthread.php?postid=777#post777
- http://forum.wolframscience.com/showthread.php?postid=791#post791
- http://forum.wolframscience.com/showthread.php?postid=1458#post1458
- http://forum.wolframscience.com/showthread.php?postid=1461#post1461
- http://forum.wolframscience.com/showthread.php?postid=1463#post1463
- http://forum.wolframscience.com/showthread.php?postid=1464#post1464
- http://forum.wolframscience.com/showthread.php?postid=1467#post1467
- http://forum.wolframscience.com/showthread.php?postid=1469#post1469
- http://forum.wolframscience.com/showthread.php?postid=1470#post1470
- http://forum.wolframscience.com/showthread.php?postid=1471#post1471
- http://forum.wolframscience.com/showthread.php?postid=1473#post1473
- http://forum.wolframscience.com/showthread.php?postid=1475#post1475
- http://forum.wolframscience.com/showthread.php?postid=1479#post1479
- http://forum.wolframscience.com/showthread.php?postid=1489#post1489
- http://forum.wolframscience.com/showthread.php?postid=1490#post1490
Inquiry List : Feb–Jun 2004
- http://stderr.org/pipermail/inquiry/2004-February/thread.html#1228
- http://stderr.org/pipermail/inquiry/2004-March/thread.html#1235
- http://stderr.org/pipermail/inquiry/2004-March/thread.html#1240
- http://stderr.org/pipermail/inquiry/2004-June/thread.html#1630
- http://stderr.org/pipermail/inquiry/2004-February/001228.html
- http://stderr.org/pipermail/inquiry/2004-February/001230.html
- http://stderr.org/pipermail/inquiry/2004-February/001231.html
- http://stderr.org/pipermail/inquiry/2004-February/001232.html
- http://stderr.org/pipermail/inquiry/2004-February/001233.html
- http://stderr.org/pipermail/inquiry/2004-February/001234.html
- http://stderr.org/pipermail/inquiry/2004-March/001235.html
- http://stderr.org/pipermail/inquiry/2004-March/001236.html
- http://stderr.org/pipermail/inquiry/2004-March/001237.html
- http://stderr.org/pipermail/inquiry/2004-March/001238.html
- http://stderr.org/pipermail/inquiry/2004-March/001240.html
- http://stderr.org/pipermail/inquiry/2004-March/001242.html
- http://stderr.org/pipermail/inquiry/2004-March/001243.html
- http://stderr.org/pipermail/inquiry/2004-March/001244.html
- http://stderr.org/pipermail/inquiry/2004-March/001245.html
- http://stderr.org/pipermail/inquiry/2004-March/001246.html
- http://stderr.org/pipermail/inquiry/2004-March/001247.html
- http://stderr.org/pipermail/inquiry/2004-March/001248.html
- http://stderr.org/pipermail/inquiry/2004-March/001249.html
- http://stderr.org/pipermail/inquiry/2004-March/001255.html
- http://stderr.org/pipermail/inquiry/2004-June/001630.html
- http://stderr.org/pipermail/inquiry/2004-June/001631.html
- http://stderr.org/pipermail/inquiry/2004-June/001632.html
- http://stderr.org/pipermail/inquiry/2004-June/001633.html
- http://stderr.org/pipermail/inquiry/2004-June/001634.html
- http://stderr.org/pipermail/inquiry/2004-June/001635.html
- http://stderr.org/pipermail/inquiry/2004-June/001636.html
- http://stderr.org/pipermail/inquiry/2004-June/001637.html
- http://stderr.org/pipermail/inquiry/2004-June/001638.html
- http://stderr.org/pipermail/inquiry/2004-June/001639.html
- http://stderr.org/pipermail/inquiry/2004-June/001640.html
- http://stderr.org/pipermail/inquiry/2004-June/001641.html
- http://stderr.org/pipermail/inquiry/2004-June/001642.html
