On Computations with Limited Storage of Entries

Single-tape Turing machines that generate binary sequences are considered. It is not assumed that the entries in the cells of the tape can be stored permanently. The storage time for a symbol in a cell depends in some way on the number of cycles involved in generating and restoring it. A law is given that ensures that any computable sequence can be generated.