12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Thursday November 07, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 02:10, 9 March 2009
, 02:10, 9 March 2009→Note 12: markup
|-
|-
|
|
<math>\begin{array}{c|cc}
<math>\begin{array}{c|cc|cc|cc|cc|cc|c}
t & u & v \\
t & u & v & du & dv & d^2 u & d^2 v & d^3 u & d^3 v & d^4 u & d^4 v & \ldots \\
\\
\\
0 & 1 & 1 \\
0 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\
1 & 1 & 1 \\
1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\
4 & '' & '' & '' & '' & '' & '' & '' & '' & '' & '' & \ldots \\
\end{array}</math>
\end{array}</math>
|}
|}
To be honest, I have never thought of trying to hack the problem in such a brute-force way until just now, and so I know enough to expect a not inappreciable probability of error about all that I've taken the risk to write out here, but let me forge ahead and see what I can see.
To be honest, I have never thought of trying to hack the problem in such a brute-force way until just now, and so I know enough to expect a not unappreciable probability of error about all that I've taken the risk to write out here, but let me forge ahead and see what I can see.
What we are looking for is — one rule to rule them all, a rule that applies to every state and works every time.
What we are looking for is — one rule to rule them all, a rule that applies to every state and works every time.
