12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Monday December 02, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 12:40, 9 March 2009
, 12:40, 9 March 2009→Note 3: try \texttt for cactus syntax
|}
|}
"Aha!" we say, and think we see the way of things, writing down the rule <math>x' = (x),\!</math> where <math>x'\!</math> is the state that comes next after <math>x,\!</math> and <math>(x)\!</math> is the negation of <math>x\!</math> in boolean logic.
"Aha!" we say, and think we see the way of things, writing down the rule <math>\texttt{x' = (x)}</math> where <math>\texttt{x'}</math> is the state that comes next after <math>\texttt{x},</math> and <math>\texttt{(x)}</math> is the negation of <math>\texttt{x}</math> in boolean logic.
Another way to detect patterns is to write out a table of finite differences. For this example, we would get:
Another way to detect patterns is to write out a table of finite differences. For this example, we would get:
