A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Unambiguous Catalytic Computation
2019
Foundations of Software Technology and Theoretical Computer Science
The catalytic Turing machine is a model of computation defined by Buhrman, Cleve, Koucký, Loff, and Speelman (STOC 2014). Compared to the classical space-bounded Turing machine, this model has an extra space which is filled with arbitrary content in addition to the clean space. In such a model we study if this additional filled space can be used to increase the power of computation or not, with the condition that the initial content of this extra filled space must be restored at the end of the
doi:10.4230/lipics.fsttcs.2019.16
dblp:conf/fsttcs/GuptaJST19
fatcat:xerymmqwifh4jbqqgijmc7yhc4