12,122
edits
Changes
MyWikiBiz, Author Your Legacy — Friday October 24, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 22:01, 11 March 2009
, 22:01, 11 March 2009cleanup
Figure 1.5. Remainder rf = Df + df
Figure 1.5. Remainder rf = Df + df
</pre>
</pre>
==Note 19==
===Computation Summary : <math>g(u, v) = \texttt{((u,~v))}</math>===
===Computation Summary : <math>g(u, v) = \texttt{((u,~v))}</math>===
<pre>
<pre>
Figure 2.1 expands g = ((u, v)) over [u, v] to get
Figure 2.1 expands g = ((u, v)) over [u, v] to get
the equivalent exclusive disjunction u v + (u)(v).
the equivalent exclusive disjunction u v + (u)(v).
