The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Two-Tape Simulation of Multitape Turing Machines
Open accessAbstract
It has long been known that increasing the number of tapes used by a Turing machine does not provide the ability to compute any new functions. On the other hand, the use of extra tapes does make it possible to speed up the computation of certain functions. It is known that a square factor is sometimes required for a one-tape machine to behave as a two-tape machine and that a square factor is always sufficient. The purpose of this paper is to show that, if a given function requires computation time T for a k -tape realization, then it requires at most computation time T log T for a two-tape realization. The proof of this fact is constructive; given any k -tape machine, it is shown how to design an equivalent two-tape machine that operates within the stated time bounds. In addition to being interesting in its own right, the trade-off relation between number of tapes and speed of computation can be used in a diagonalization argument to show that if T ( n ) and U ( n ) are two time functions such that inf T ( n ) log T ( n ) ÷ U ( n ) = 0 then there exists a function that can be computed within the time bound U ( n ) but not within the time bound T ( n ).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
On the computational complexity of algorithms
Hartmanis, J., & Stearns, R. E. (1965) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1965-0170805-7 · Cited by 1,006
Self-citationReal-Time Computation and Recursive Functions Not Real-Time Computable
Yamada, H. (1962) · IEEE Transactions on Electronic Computers · doi:10.1109/tec.1962.5219459 · Cited by 89
Cited by
Recognition and parsing of context-free languages in time n3
Younger, D. H. (1967) · Information and Control · doi:10.1016/s0019-9958(67)80007-x · Cited by 935
Relations Among Complexity Measures
Pippenger, N., & Fischer, M. J. (1979) · Journal of the ACM · doi:10.1145/322123.322138 · Cited by 387
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Cook, S. A. (1971) · Journal of the ACM · doi:10.1145/321623.321625 · Cited by 360
Hierarchies of memory limited computations
Stearns, R. E., Hartmanis, J., & Lewis, P. M. (1965) · 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965) · doi:10.1109/focs.1965.11 · Cited by 352
Self-citationMoore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Metadata
- Authors
- Hennie, F. C., & Stearns, R. E.
- Venue
- Journal of the ACM
- Published
- 1966-10
- Volume
- 13
- Issue
- 4
- Pages
- 533-546
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2004471951
- Cited by
- 285
- References
- 3
- FWCI
- 4.35
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Two-Tape Simulation of Multitape Turing Machines. https://app.cochat.ai/papers/10.1145/321356.321362
- The paper
- Hennie, F. C., & Stearns, R. E. (1966). Two-Tape Simulation of Multitape Turing Machines. Journal of the ACM. https://doi.org/10.1145/321356.321362
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.