|
Problemy Peredachi Informatsii, 1978, Volume 14, Issue 4, Pages 105–108
(Mi ppi1564)
|
|
|
|
Сorrespondence
On Computations with Limited Storage of Entries
V. K. Bulitko, D. P. Probst
Abstract:
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.
Received: 31.12.1976
Citation:
V. K. Bulitko, D. P. Probst, “On Computations with Limited Storage of Entries”, Probl. Peredachi Inf., 14:4 (1978), 105–108; Problems Inform. Transmission, 14:4 (1978), 313–315
Linking options:
https://www.mathnet.ru/eng/ppi1564 https://www.mathnet.ru/eng/ppi/v14/i4/p105
|
Statistics & downloads: |
Abstract page: | 129 | Full-text PDF : | 54 |
|