Efficient Simulation of Space-Bounded Computations Using Almost-Catalytic Turing Machines

Almost-catalytic Turing machines can efficiently simulate space-bounded computations by relaxing the restoration requirement on the catalytic tape content, leading to new algorithmic approaches for designing catalytic algorithms.