Designing algorithms for space bounded models with restoration requirements on the space used by the algorithm is an important challenge posed about the catalytic computation model introduced by Buhrman et al. (2014). Motivated by the scenarios where we do not need to restore unless is useful, we define $ACL(A)$ to be the class of languages that can be accepted by almost-catalytic Turing machines with respect to $A$ (which we call the catalytic set), that uses at most $c\log n$ work space and $n^c$ catalytic space. We show that if there are almost-catalytic algorithms for a problem with catalytic set as $A \subseteq \Sigma^*$ and its complement respectively, then the problem can be solved by a ZPP algorithm. Using this, we derive that to design catalytic algorithms, it suffices to design almost-catalytic algorithms where the catalytic set is the set of strings of odd weight ($PARITY$). Towards this, we consider two complexity measures of the set $A$ which are maximized for $PARITY$ - random projection complexity (${\cal R}(A)$) and the subcube partition complexity (${\cal P}(A)$). By making use of error-correcting codes, we show that for all $k \ge 1$, there is a language $A_k \subseteq \Sigma^*$ such that $DSPACE(n^k) \subseteq ACL(A_k)$ where for every $m \ge 1$, $\mathcal{R}(A_k \cap \{0,1\}^m) \ge \frac{m}{4}$ and $\mathcal{P}(A_k \cap \{0,1\}^m)=2^{m/4}$. This contrasts the catalytic machine model where it is unclear if it can accept all languages in $DSPACE(\log^{1+\epsilon} n)$ for any $\epsilon > 0$. Improving the partition complexity of the catalytic set $A$ further, we show that for all $k \ge 1$, there is a $A_k \subseteq \{0,1\}^*$ such that $\mathsf{DSPACE}(\log^k n) \subseteq ACL(A_k)$ where for every $m \ge 1$, $\mathcal{R}(A_k \cap \{0,1\}^m) \ge \frac{m}{4}$ and $\mathcal{P}(A_k \cap \{0,1\}^m)=2^{m/4+\Omega(\log m)}$.

翻译：暂无翻译