On the Contribution of Backward Jumps to Instruction Sequence Expressiveness

We investigate the expressiveness of backward jumps in a frame work of formalized sequential programming called program algebra and characterize established non-uniform complexity classes in terms of instruction sequences, backward jumps and auxiliary registers.

[1]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[2]  Jan A. Bergstra,et al.  Functional units for natural numbers , 2009, ArXiv.

[3]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

[4]  Jan A. Bergstra,et al.  Autosolvability of halting problem instances for instruction sequences , 2009, ArXiv.

[5]  D. B. Bui,et al.  Theory of program algebras , 1984 .

[6]  Ingo Wegener,et al.  Branching Programs and Binary Decision Diagrams , 1987 .

[7]  Jan A. Bergstra,et al.  Program algebra for sequential code , 2002, J. Log. Algebraic Methods Program..

[8]  Jan A. Bergstra,et al.  Polarized Process Algebra and Program Equivalence , 2003, ICALP.

[9]  D. B. Bui,et al.  Mutual derivability of operations in program algebras. II , 1988 .

[10]  José L. Balcázar,et al.  On Characterizations of the Class PSPACE/POLY , 1987, Theor. Comput. Sci..

[11]  Uwe Schöning.  Complexity and Structure , 1986, Lecture Notes in Computer Science.

[12]  Alban Ponse,et al.  An Introduction to Program and Thread Algebra , 2006, CiE.

[13]  J. V. Wright.  An Interactive Metatool for Exploring Program Algebras , 1999 .

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

[15]  Jan A. Bergstra,et al.  Decision problems for pushdown threads , 2007, Acta Informatica.

[16]  Jan A. Bergstra,et al.  Combining programs and state machines , 2002, J. Log. Algebraic Methods Program..

[17]  Jan A. Bergstra,et al.  Instruction sequence processing operators , 2009, Acta Informatica.

[18]  Jan A. Bergstra,et al.  Thread algebra for strategic interleaving , 2007, Formal Aspects of Computing.

[19]  Jan A. Bergstra,et al.  Instruction sequences and non-uniform complexity theory , 2008, ArXiv.

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

[21]  K. V. Rudakov.  Application of universal constraints in the analysis of classification algorithms , 1988 .

[22]  Alan Cobham,et al.  The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.

[23]  Jack H. Lutz,et al.  Circuit Size Relative to Pseudorandom Oracles , 1993, Theor. Comput. Sci..