Instruction sequences and non-uniform complexity theory

We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of the complexity classes P/poly and NP/poly and formulate a counterpart of the complexity theoretic conjecture that NP is not included in P/poly. In addition, we define a notion of completeness for the counterpart of NP/poly using a non-uniform reducibility relation and formulate complexity hypotheses which concern restrictions on the instruction sequences used for computation. We think that the theory developed opens up an additional way of investigating issues concerning non-uniform complexity.

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

[2]  Oded Goldreich,et al.  Computational complexity: a conceptual perspective , 2008, SIGA.

[3]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[4]  Jan A. Bergstra,et al.  Division Safe Calculation in Totalised Fields , 2008, Theory of Computing Systems.

[5]  Jan A. Bergstra,et al.  An Interface Group for Process Components , 2007, Fundam. Informaticae.

[6]  Jan A. Bergstra,et al.  Program algebra with a jump-shift instruction , 2007, J. Appl. Log..

[7]  Jan A. Bergstra,et al.  Projection semantics for rigid loops , 2007, ArXiv.

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

[9]  Jan A. Bergstra,et al.  Parallel Processes with Implicit Computational Capital , 2008, LIX.

[10]  Jan A. Bergstra,et al.  Execution architectures for program algebra , 2004, J. Appl. Log..

[11]  Jan A. Bergstra,et al.  Distributed strategic interleaving with load balancing , 2008, Future Gener. Comput. Syst..

[12]  Jan A. Bergstra,et al.  Instruction Sequences with Dynamically Instantiated Instructions , 2009, Fundam. Informaticae.

[13]  Alban Ponse,et al.  Risk Assessment for One-Counter Threads , 2008, Theory of Computing Systems.

[14]  Jan A. Bergstra,et al.  On the Expressiveness of Single-Pass Instruction Sequences , 2010, Theory of Computing Systems.

[15]  A. Barros,et al.  A constructive version of AIP revisited , 2008 .

[16]  Jan A. Bergstra,et al.  Tuplix Calculus Specifications of Financial Transfer Networks , 2008, ArXiv.

[17]  Jan A. Bergstra,et al.  Instruction Sequences with Indirect Jumps , 2007, Sci. Ann. Comput. Sci..

[18]  Donald Sannella,et al.  Algebraic Preliminaries , 1999, Algebraic Foundations of Systems Specification.

[19]  I. Wegener.  Branching Programs and Binary Deci-sion Diagrams-Theory and Applications , 1987 .

[20]  Jan A. Bergstra,et al.  An upper bound for the equational specification of finite state services , 2005, Inf. Process. Lett..

[21]  Allan Borodin,et al.  Bounds for width two branching programs , 1983, SIAM J. Comput..

[22]  José L. Balcázar,et al.  Uniform Characterizations of Non-Uniform Complexity Measures , 1985, Inf. Control..

[23]  M. B. van der Zwaag,et al.  UvA Budget Allocatie Model , 2008 .

[24]  Jan A. Bergstra,et al.  Interface Groups for Analytic Execution Architectures , 2006 .

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

[26]  Dennis M. Ritchie,et al.  The complexity of loop programs , 1967, ACM National Conference.

[27]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[28]  Jan A. Bergstra,et al.  Interface groups and financial transfer architectures , 2007, ArXiv.

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

[30]  Jan A. Bergstra,et al.  Synchronous cooperation for explicit multi-threading , 2007, Acta Informatica.

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

[32]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

[34]  Jan A. Bergstra,et al.  A Thread Algebra with Multi-level Strategic Interleaving , 2005, CiE.

[35]  T. D. Vu.  Metric Denotational Semantics for BPPA , 2005 .

[36]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .