12,186
edits
Changes
MyWikiBiz, Author Your Legacy — Wednesday January 14, 2026
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 20:44, 4 March 2009
, 20:44, 4 March 2009→Note 10: markup
We are considering an abstract logical transformation <math>F = (f, g) : [u, v] \to [x, y]</math> 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:
We are considering an abstract logical transformation <math>F = (f, g) : [u, v] \to [x, y]</math> 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:
{| align="center" cellpadding="8" width="90%"
|
<math>\begin{array}{lccccc}
\text{Alias Map.} & (x, y) & = & F(u, v) & = & ( ~\underline{((}~ u ~\underline{)(}~ v ~\underline{))}~ , ~\underline{((}~ u ~,~ v ~\underline{))}~ )
\\ \\
\text{Alibi Map.} & (u', v') & = & F(u, v) & = & ( ~\underline{((}~ u ~\underline{)(}~ v ~\underline{))}~ , ~\underline{((}~ u ~,~ v ~\underline{))}~ )
\end{array}</math>
|}
<pre>
<pre>
F is just one example among -- well, now that I think of it --
F is just one example among -- well, now that I think of it --
how many other logical transformations from the same source
how many other logical transformations from the same source
