12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Wednesday June 26, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 01:51, 11 March 2009
, 01:51, 11 March 2009→Note 18: markup
==Note 18==
==Note 18==
Let's push on with the analysis of the transformation:
Let's push on with the analysis of the transformation:
F : <u, v> ~> <f<u, v>, g<u, v>> = <((u)(v)), ((u, v))>
{| align="center" cellpadding="8" width="90%"
|
<math>\begin{matrix}
F & : & (u, v) & \mapsto & (f(u, v),~g(u, v)) & = & (~\texttt{((u)(v))}~,~\texttt{((u,~v))}~).\end{matrix}</math>
|}
For ease of comparison and computation, I will collect
For ease of comparison and computation, I will collect the Figures that we need for the remainder of the work together on one page.
the Figures that we need for the remainder of the work
together on one page.
Computation Summary for f<u, v> = ((u)(v))
===Computation Summary : <math>f(u, v) = \texttt{((u)(v))}</math>===
<pre>
Figure 1.1 expands f = ((u)(v)) over [u, v] to produce
Figure 1.1 expands f = ((u)(v)) over [u, v] to produce
the equivalent exclusive disjunction uv + u(v) + (u)v.
the equivalent exclusive disjunction uv + u(v) + (u)v.
