In computational complexity theory, a log-space computable function is a function
memory to be computed (this restriction does not apply to the size of the output).
The computation is generally done by means of a log-space transducer.
This is a means of transforming an instance of one problem into an instance of another problem, using only logarithmic space.
This theoretical computer science–related article is a stub.