Lectures on Linear Sequential Machines
Lectures on Linear Sequential Machines
Graph Theory With Applications
Graph Theory With Applications
The orbit problem in higher dimensions
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The “accessibility problem” for linear sequential machines (Harrison [7]) is the problem of deciding whether there is an input x that sends such a machine from a given state q1 to a given state q2. Harrison [7] showed that this problem is reducible to the “orbit problem:” Given A&egr;Qn×n does there exist i&egr;N such that Aix &equil;y.* We will call this the “orbit problem” because the question can be rephrased as: Does y belong to the orbit of x under A where the “orbit of x under A” is the set {Aix: i &equil; 0,1,2,...}. (A0 is the identity matrix I.) In Harrison's original problem the elements of A,x, and y were members of an arbitrary “computable” field. In view of the lack of structure of such fields, we study only the rationals. Shank [13] proves that the orbit problem is decidable for the rational case when n&equil;2. The current paper establishes that for the general rational case, the problem is decidable - and in fact polynomial-time decidable. We wish to give a brief idea of our approach to the problem.