On the complexity of space bounded interactive proofs

Two results on interactive proof systems with two-way probabilistic finite-state verifiers are proved. The first is a lower bound on the power of such proof systems if they are not required to halt with high probability on rejected inputs: it is shown that they can accept any recursively enumerable language. The second is an upper bound on the power of interactive proof systems that halt with high probability on all inputs. The proof method for the lower bound also shows that the emptiness problem for one-way probabilistic finite-state machines is undecidable. In the proof of the upper bound some results of independent interest on the rate of convergence of time-varying Markov chains to their halting states are obtained.<<ETX>>

[1]  Richard E. Ladner,et al.  Probabilistic Game Automata , 1986, J. Comput. Syst. Sci..

[2]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[3]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[4]  Joe Kilian,et al.  Zero-knowledge with log-space verifiers , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[5]  J. Wolfowitz.  Products of indecomposable, aperiodic, stochastic matrices , 1963 .

[6]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[7]  Rusins Freivalds,et al.  Probabilistic Two-Way Machines , 1981, MFCS.

[8]  L. Fortnow,et al.  On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[9]  Anne Condon,et al.  Computational models of games , 1989, ACM distinguished dissertations.

[10]  John H. Reif,et al.  Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[11]  Richard E. Ladner,et al.  Probabilistic Game Automata , 1988, J. Comput. Syst. Sci..

[12]  D. Blackwell,et al.  Proof of Shannon's Transmission Theorem for Finite-State Indecomposable Channels , 1958 .

[13]  A. Paz.  Definite and quasidefinite sets of stochastic matrices , 1965 .

[14]  Adi Shamir,et al.  Multi-oracle interactive protocols with space bounded verifiers , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[15]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .