12,122
edits
Changes
Directory:Jon Awbrey/Papers/Differential Analytic Turing Automata (view source)
Revision as of 15:40, 1 March 2009
, 15:40, 1 March 2009→Note 6: markup
Now, to the Example.
Now, to the Example.
Once again, let us begin with a 1-feature alphabet <math>\mathcal{X} = \{ x_1 \} = \{ x \}.</math> In the discussion that follows I will consider a class of trajectories that are ruled by the constraint that <math>d^k x = 0\!</math> for all <math>k\!</math> greater than some fixed <math>m,\!</math> and I will indulge in the use of some picturesque speech to describes salient classes of such curves. Given this finite order condition, there is a highest order non-zero difference <math>d^m x\!</math> that is exhibited at each point in the course of any determinate trajectory.
Relative to any point of the corresponding orbit or curve, let us call this highest order differential feature <math>d^m x\!</math> the ''drive'' at that point. Curves of constant drive <math>d^m x\!</math> are then referred to as ''<math>m^\text{th}\!</math> gear curves''.
<pre>
<pre>
One additional piece of notation will be needed here.
One additional piece of notation will be needed here.
Starting from the base alphabet !X! = {x}, we define
Starting from the base alphabet !X! = {x}, we define