12,122
edits
Changes
MyWikiBiz, Author Your Legacy — Saturday October 25, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 10:02, 18 March 2009
, 10:02, 18 March 2009→Turing Machine Example: descriptive headings
|}
|}
===Note 32===
===Computation===
<pre>
<pre>
The propositional program for Stunt(2) uses the following set
The propositional program for Stunt(2) uses the following set
of (9 + 12 + 36) = 57 basic propositions or boolean variables:
of (9 + 12 + 36) = 57 basic propositions or boolean variables:
</pre>
</pre>
===Note 33===
===Output===
<pre>
<pre>
One component of the Theme One program that I wrote some years ago
One component of the Theme One program that I wrote some years ago
finds all the satisfying interpretations of propositions expressed
finds all the satisfying interpretations of propositions expressed
