×

\(k\) versus \(k+1\) index registers and modifiable versus non-modifiable programs. (English) Zbl 0755.68046

Summary: We compare random access machines with \(k\) or \(k+1\) index registers and modifiable or non-modifiable programs and show for a simple problem of data transfer that the more powerful versions are more efficient.

MSC:

68Q05 Models of computation (Turing machines, etc.) (MSC2010)
68Q25 Analysis of algorithms and problem complexity
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aanderaa, S. O., On \(k\)-tape versus \((k\) − 1)-tape real-time computation, (Complexity of Computation (1974)), 75-96 · Zbl 0316.68029
[2] Li, M.; Vitányi, P. M.B., Tape versus queue and stacks: The lower bounds, Inform. and Comput., 78, 56-85 (1988) · Zbl 0655.68046
[3] Maass, W.; Schnitger, G.; Szemeredi, E., Two tapes are better than one for off-line Turing machines, (Proc. 19th ACM Symposium on Theory of Computing (1987)), 94-100
[4] Mehlhorn, K.; Paul, W. J., Two versus one index register and modifiable versus non-modifiable programs, (Proc. 16th International Colloquium on Automata, Languages and Programming, LNCS 372 (1989)), 603-609 · Zbl 0682.68065
[5] Paul, W. J., On-line simulation of \(k+1\) tapes by \(k\) tapes requires non-linear time, Inform. Contr., 53, 1-8 (1982) · Zbl 0536.68049
[6] Paul, W. J., On heads versus tapes, Theoret. Comput. Sci., 28, 1-12 (1980) · Zbl 0536.68050
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.