On the Complexity of Polynomial Recurrence Sequences
- 8 Downloads
We consider recurrence sequences over the set of integers with generating functions being arbitrary superpositions of polynomial functions and the sg function, called polynomial recurrence sequences. We define polynomial-register (PR) machines, close to random-access machines. We prove that computations on PR machines can be modeled by polynomial recurrence sequences. On the other hand, computation of elements of a polynomial recurrence sequence can be implemented using a suitable PR machine.
Unable to display preview. Download preview PDF.
- 1.Hall, M., Jr., Combinatorial Theory, Waltham: Blaisdell, 1967. Translated under the title Kombinatorika, Moscow: Mir, 1970.Google Scholar
- 2.Nechaev, V.I., Elementy kriptografii: osnovy teorii zashchity informatsii (Elements of Cryptography: Basics of Information Protection Theory), Moscow: Vyssh. Shkola, 1999.Google Scholar
- 4.Minsky, M.L., Computation: Finite and Infinite Machines, Englewood Cliffs, NJ: Prentice-Hall, 1967. Translated under the title Vychisleniya i avtomaty, Moscow: Mir, 1971.Google Scholar