论文信息 - A Characterization of the Power of Vector Machines

A Characterization of the Power of Vector Machines

A new formal model of register machines is described. Registers contain bit vectorswhich are manipulated using bitwise Boolean operations and shifts. Our main results relate the language recognition power of such vector machines to that of Turing machines. A class of vector machines is exhibited for which time on a vector machine supplies, to within a polynomial, just as much power as space on a Turing machine. Moreover, this is true regardless of whether the machines are deterministic or non-deterministic.

Larry J. Stockmeyer | Vaughan R. Pratt | L. Stockmeyer | V. Pratt

[1] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[2] Stephen A. Cook,et al. An Observation on Time-Storage Trade Off , 1974, J. Comput. Syst. Sci..

[3] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[4] Richard Edwin Stearns,et al. Hierarchies of memory limited computations , 1965, SWCT.

[5] John C. Shepherdson,et al. Computability of Recursive Functions , 1963, JACM.

[6] Richard Edwin Stearns,et al. Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[7] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[8] Stephen A. Cook,et al. Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..

[9] Juris Hartmanis,et al. On the Power of Multiplication in Random Access Machines , 1974, SWAT.

[10] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[11] Larry J. Stockmeyer,et al. A characterization of the power of vector machines , 1974, STOC '74.

[12] S.-Y. Kuroda,et al. Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..