This seems very theoretical, just a lower bound on space required, without talking about what is being computed. Does it have any import on real algorithms?
It's a reduction from multitape Turing machine to tree evaluations. If your "real algorithm" is straightforwardly modeled by a multitape TM, then it might be possible to use this proof to reduce the space. Otherwise, I don't think so.