Randomized and Symmetric Catalytic Computation

A catalytic Turing machine is a model of computation that is created by equipping a Turing machine with an additional auxiliary tape which is initially filled with arbitrary content; the machine can read or write on auxiliary tape during the computation but when it halts auxiliary tape’s initial content must be restored. In this paper, we study the power of catalytic Turing machines with \(O(\log n)\)-sized clean tape and a polynomial-sized auxiliary tape.

[2]  Chetan Gupta,et al.  Unambiguous Catalytic Computation , 2019, Electron. Colloquium Comput. Complex..

[3]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[4]  Michal Koucký.  Nonuniform catalytic space and the direct sum for space , 2015, Electron. Colloquium Comput. Complex..

[5]  Dieter van Melkebeek,et al.  Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.

[6]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

[7]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[8]  Harry Buhrman,et al.  Catalytic Space: Non-determinism and Hierarchy , 2017, Theory of Computing Systems.

[9]  Harry Buhrman,et al.  Computing with a full memory: catalytic space , 2014, STOC.

[10]  Michal Koucký,et al.  Universal traversal sequences with backtracking , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.