ONT Re: Differential Analytic Turing Automata

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o

DATA.  Note 4

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o

I am preparing a more fleshed-out 1-variable example,
but in the mean time, for anybody who's finished all
that other reading, there is a more detailed account
of differential logic at the following thread heads:

DLOG D.  http://stderr.org/pipermail/inquiry/2003-May/thread.html#478
DLOG D.  http://stderr.org/pipermail/inquiry/2003-June/thread.html#553

For future reference, here are a couple of handy rosetta stones
for translating back and forth between different notations for
the boolean functions f : B^k -> B, where k = 1, 2.

DLOG D11.  http://stderr.org/pipermail/inquiry/2003-May/000489.html

Jon Awbrey

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o
inquiry e-lab: http://stderr.org/pipermail/inquiry/
o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o