12,089
edits
Changes
MyWikiBiz, Author Your Legacy — Wednesday September 10, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 03:16, 9 March 2009
, 03:16, 9 March 2009→Note 13: markup
==Note 13==
==Note 13==
I think that 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.
I think that it ought to be clear at this point that we
need a more systematic symbolic method for computing the
For convenience of reference, let's recast our current example in the following form:
differentials of logical transformations, using the term
finite differences and derivatives, leaving it to another
discussion to sharpen up its more exact technical senses.
{| align="center" cellpadding="8" width="95%"
| <math>F ~=~ (f, g) ~=~ ( ~\underline{((}~ u ~\underline{)(}~ v ~\underline{))}~, ~\underline{((}~ u ~,~ v ~\underline{))}~ ).</math>
|}
<pre>
In their application to this logical transformation the operators
In their application to this logical transformation the operators
E and D respectively produce the "enlarged map" EF = <Ef, Eg> and
E and D respectively produce the "enlarged map" EF = <Ef, Eg> and
