A problem with a demonstrable Ume-space trade-off Is exhibited The problem is to compile a straight-line program for a certain unmterprted expression; time ~s reckoned as the number of mstrucUons m the program, space as the number of registers referred to There are programs using linear space and linear tune, but any program using less than linear space uses more than linear rune
No takes yet. Share an insight, caveat, or question.
Nicholas Pippenger (1978) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: