12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Thursday June 27, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 00:38, 4 March 2009
, 00:38, 4 March 2009→Note 8: markup
<br>
<br>
The component notation <math>F = (F_1, F_2) = (f, g) : U^\circ \to X^\circ</math> allows us to give a name and a type to this transformation, and permits us to define it by means of the compact description that follows:
The component notation F = <F_1, F_2> = <f, g> : U% -> X% allows
us to give a name and a type to this transformation, and permits
us to define it by means of the compact description that follows:
<x, y> = F<u, v> = <((u)(v)), ((u, v))>
{| align="center" cellpadding="8" width="90%"
| <math>(x, y) ~=~ F(u, v) ~=~ ( ~\underline{((}~ u ~\underline{)(}~ v ~\underline{))}~ , ~\underline{((}~ u ~,~ v ~\underline{))}~ ).</math>
|}
The information that defines the logical transformation F
The information that defines the logical transformation <math>F\!</math> can be represented in the form of a truth table, as below.
can be represented in the form of a truth table, as below.
<pre>
u v | f g
u v | f g
----+----
----+----
1 0 | 1 0
1 0 | 1 0
1 1 | 1 1
1 1 | 1 1
</pre>
A more complete framework of discussion and a fuller development of
A more complete framework of discussion and a fuller development of this example can be found in the neighborhood of the following site:
this example can be found in the neighborhood of the following site:
:* [http://stderr.org/pipermail/inquiry/2003-June/000557.html DLOG D73]
==Note 9==
==Note 9==
