Three problems on the decidability and complexity of stability

All three problems are yes-no decision problems; upon input of the data associated with an instance of the problem, we wish to decide whether a certain property is satisfied by the instance. Many results are available in the literature for these three problems, but no satisfactory answers are yet available. We suggest looking at the decidability and at the computational complexity of these three problems.

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

[2]  B. Anderson,et al.  Output feedback stabilization and related problems-solution via decision methods , 1975 .

[3]  J. Tsitsiklis.  The Stability of the Products of a Finite Set of Matrices , 1987 .

[4]  Thomas M. Cover,et al.  Open Problems in Communication and Computation , 2011, Springer New York.

[5]  Eduardo Sontag,et al.  Turing computability with neural nets , 1991 .

[6]  I. Daubechies,et al.  Sets of Matrices All Infinite Products of Which Converge , 1992 .

[7]  Eduardo Sontag.  From linear to nonlinear: some complexity comparisons , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[8]  J. Lagarias,et al.  The finiteness conjecture for the generalized spectral radius of a set of matrices , 1995 .

[9]  L. Gurvits.  Stability of discrete linear inclusion , 1995 .

[10]  Hava T. Siegelmann,et al.  On the Computational Power of Neural Nets , 1995, J. Comput. Syst. Sci..

[11]  J. Tsitsiklis,et al.  NP-hardness of some linear control design problems , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[12]  Pascal Koiran.  A Family of Universal Recurrent Networks , 1996, Theor. Comput. Sci..

[13]  J. Tsitsiklis,et al.  Spectral quantities associated to pairs of matrices are hard, when not impossible, to compute and to approximate , 1996 .

[14]  J. Tsitsiklis,et al.  NP-Hardness of Some Linear Control Design Problems , 1997 .

[15]  John N. Tsitsiklis,et al.  The Lyapunov exponent and joint spectral radius of pairs of matrices are hard—when not impossible—to compute and to approximate , 1997, Math. Control. Signals Syst..

[16]  John N. Tsitsiklis,et al.  Complexity of stability and controllability of elementary hybrid systems , 1999, Autom..

[17]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.