12,122
edits
Changes
MyWikiBiz, Author Your Legacy — Sunday October 26, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 12:54, 10 March 2009
, 12:54, 10 March 2009→Computation Summary : <math>g(u, v) = \texttt{((u,~v))}</math>: expand figure intro
===Computation Summary : <math>g(u, v) = \texttt{((u,~v))}</math>===
===Computation Summary : <math>g(u, v) = \texttt{((u,~v))}</math>===
Figure 2.1 expands <math>g = \texttt{((u,~v))}</math> over <math>[u, v]\!</math> into the logically equivalent exclusive disjunction: <math>\texttt{uv ~+~ (u)(v)}.</math>
The venn diagram in Figure 2.1 shows how the proposition <math>g = \texttt{((u,~v))}</math> can be expanded over the universe of discourse <math>[u, v]\!</math> to produce a logically equivalent exclusive disjunction, namely, <math>\texttt{uv ~+~ (u)(v)}.</math>
<pre>
<pre>
