article

Free access

Two heads are better than two tapes

Authors:

Tao Jiang,

Joel I. Seiferas,

Paul M. B. VitányiAuthors Info & Claims

Journal of the ACM (JACM), Volume 44, Issue 2

Pages 237 - 256

https://doi.org/10.1145/256303.256308

Published: 01 March 1997 Publication History

PDF eReader

Abstract

We show that a Turing machine with two single-head one-dimensional tapes cannot recognize the set.

References

[1]

AANDERAA, S. 0. 1974. 1974. On k-tape versus (k - 1)-tape real time computation. In Complexity of Computation (SIAM-AMS Proceedings 7) R. M. Karp. ed. American Mathematical Society, Providence, R. I., pp. 75-96.

Google Scholar

[2]

BE#V#.#, J. 1965. Real-time and complexity problems in automata theory. Kyberntika 1, 6, 475- 497.

Google Scholar

[3]

BENNISON, g. L. 1974. Saving tapes in the simulation of multihead Turing machines. SIGACT News 6, 2 (Apr.), 23-26.

Crossref

Google Scholar

[4]

CHUNG, F. R. K., TARJAN, R. E., PAUL, W. J., AND REISCHUK, R. 1985. Coding strings by pairs of strings. SIAM J. Disc. Math. 6, 3 (July), 445-461.

Google Scholar

[5]

DURIS, P., GALIL, Z., PAUL, W. J., AND REISCHUK, R. 1984. Two nonlinear lower bounds for on-line computations. Inf. Cont. 60, 1-3 (Jan.-Mar.), 1-11.

Crossref

Google Scholar

[6]

FISCHER, P. C., MEYER, A. R., AND ROSENBERG, A.L. 1972. Real-time simulation of multihead tape units. J. ACM 19, 4 (Oct.), 590-607.

Crossref

Google Scholar

[7]

GRIGORmV, D. Yu. 1977. Imbedding theorems for Turing machines of different dimensions and Kolmogorov's algorithms. Soy. Math. 18, 3 (May-June), 588-592.

Google Scholar

[8]

HARTMANIS, J., AND STEARNS, R.E. 1965. On the computational complexity of algorithms. Trans. Am. Math. Soc. 117, 5 (May), 285-306.

Google Scholar

[9]

HENNIE, F.C. 1966. On-line Turing machine computations. IEEE Trans. Elect. Comput. EC-15, 1 (Feb.), 35-44.

Google Scholar

[10]

KOLMOGOROV, A.N. 1965. Three approaches to the quantitative definition of information. Prob. Inf. Transm. 1, 1 (Jan.-Mar.), 1-7.

Google Scholar

[11]

LEONG, B. L., AND SEIFERAS, J.I. 1981. New real-time simulations of multihead tape units. J. ACM 28, 1 (Jan.), 166-180.

Crossref

Google Scholar

[12]

LI, M., LONGPRt#, L., AND VITANYI, P. M.B. 1992. The power of the queue. SIAM J. Comput. 21, 4 (Aug.), 697-712.

Crossref

Google Scholar

[13]

LI, M., AND VITANYI, P. M. B. 1988. Tape versus queue and stacks: The lower bounds. Inf. Comput. 78, 1 (July), 56-85.

Crossref

Google Scholar

[14]

LI, M., AND VITANYI, P. M.B. 1993. An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, New York.

Crossref

Google Scholar

[15]

MAASS, W. 1985. Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines. Trans. Am. Math. Soc. 292, 2 (Dec.), 675-693.

Google Scholar

[16]

MAASS, W., SCHNITGER, G., SZEMERt#DI, E., AND TURAN, G. 1993. Two tapes versus one for off-line Turing machines. Comput. Complex. 3, 4, 392-401.

Crossref

Google Scholar

[17]

MEYER, A.R. 1971. An optimal time bound for a one tape on-line Turing machine computation. Unpublished manuscript. (Earlier version cited in MEYER EY AL. 1967.)

Google Scholar

[18]

MEYER, A. R., ROSENBERG, A. L., AND FISCHER, P. C. 1967. Turing machines with several read-write heads, preliminary report. In IEEE Conference Record of 1967 8th Annual Symposium on Switching and Automata Theory. IEEE Computer Society, Long Beach, Calif., pp. 117-127.

Google Scholar

[19]

PATURI, R., SEIFERAS, J. I., SIMON, J., AND NEWMAN-WOLFE, R.E. 1990. Milking the Aanderaa argument. Inf. Comput. 88, 1 (Sept.), 88-104.

Crossref

Google Scholar

[20]

PAUL, W.J. 1982. On-line simulation of k + 1 tapes by k tapes requires nonlinear time. Inf. Cont. 53, 1-2 (Apr.-May), 1-8.

Google Scholar

[21]

PAUL, W.J. 1984. On heads versus tapes. Theoret. Comput. Sci. 28, 1-2 (Jan.), 1-12.

Google Scholar

[22]

PAUL, W. J., SEIFERAS, J. I., AND SIMON, J. 1981. An information-theoretic approach to time bounds for on-line computation. J. Comput. Syst. Sci. 23, 2 (Oct.), 108-126.

Google Scholar

[23]

RABIN, M.O. 1963. Real time computation. Is. J. Math. 1, 4 (Dec.), 203-211.

Google Scholar

[24]

SCHNITZLEIN, W., AND STOle, H.-J. 1989. Linear-time simulation of multihead Turing machines. Inf. Comput. 81, 3 (June), 353-363.

Crossref

Google Scholar

[25]

STOI3, H.-J. 1970. k-Band-Simulation von k-Kopf-Turing-Maschinen. Computing 6, 3, 309-317 (in German).

Google Scholar

[26]

VALmV, K. 1970/1973. Certain estimates of the time of computation on Turing machines with an input. Cybernetics 6, 6 (June 1973), 734-741 (translated from Russian, published in Kibernetika 6, 6 (Nov.-Dec. 1970), 26-32).

Google Scholar

[27]

VITANYI, P. M.B. 1984. On two-tape real-time computation and queues. J. Comput. Syst. Sci. 29, 3 (Dec.), 303-311.

Google Scholar

[28]

ZVONKIN, A. K., AND LEVIN, g.A. 1970. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Surv. 25, 6 (Nov.-Dec.), 83-124.

Google Scholar

Cited By

View all

Panichella SDi Sorbo A(2023)Summary of the 2nd Natural Language-based Software Engineering Workshop (NLBSE 2023)ACM SIGSOFT Software Engineering Notes10.1145/3617946.361795748:4(60-63)Online publication date: 17-Oct-2023
https://dl.acm.org/doi/10.1145/3617946.3617957
Bucchiarone ACooper KLin DSmith AWanick V(2023)Fostering Collaboration and Advancing Research in Software Engineering and Game Development for Serious ContextsACM SIGSOFT Software Engineering Notes10.1145/3617946.361795548:4(46-50)Online publication date: 17-Oct-2023
https://dl.acm.org/doi/10.1145/3617946.3617955
Weyns DCalinescu RMirandola RTei KAcosta MBennaceur ABoltz NBures TCamara JDiaconescu AEngels GGerasimou SGerostathopoulos IGetir Yaman SGrassi VHahner SLetier ELitoiu MMarsso LMusil AMusil JNunes Rodrigues GPerez-Palacin DQuin FScandurra PVallecillo AZisman A(2023)Towards a Research Agenda for Understanding and ManagingUncertainty in Self-Adaptive SystemsACM SIGSOFT Software Engineering Notes10.1145/3617946.361795148:4(20-36)Online publication date: 17-Oct-2023
https://dl.acm.org/doi/10.1145/3617946.3617951
Show More Cited By

Index Terms

Two heads are better than two tapes

Recommendations

Two Heads are Better than Two Tapes
Two tapes are better than one for nondeterministic machines
STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing

It is known that k tapes are no better than two tapes for nondeterministic machines. We show here that two tapes are better than one. In fact, we show that two pushdown stores are better than one tape. Also, k tapes are no better than two for ...
Two tapes are better than one for off-line Turing machines
STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

We prove the first superlinear lower bound for a concrete decision problem in P on a Turing machine with one work tape and a two-way input tape (also called: off-line 1-tape Turing machine). In particular we show for off-line Turing machines that 2 ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 44, Issue 2

March 1997

161 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/256303

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1997

Published in JACM Volume 44, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
594
Total Downloads

Downloads (Last 12 months)71
Downloads (Last 6 weeks)17

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Panichella SDi Sorbo A(2023)Summary of the 2nd Natural Language-based Software Engineering Workshop (NLBSE 2023)ACM SIGSOFT Software Engineering Notes10.1145/3617946.361795748:4(60-63)Online publication date: 17-Oct-2023
https://dl.acm.org/doi/10.1145/3617946.3617957
Bucchiarone ACooper KLin DSmith AWanick V(2023)Fostering Collaboration and Advancing Research in Software Engineering and Game Development for Serious ContextsACM SIGSOFT Software Engineering Notes10.1145/3617946.361795548:4(46-50)Online publication date: 17-Oct-2023
https://dl.acm.org/doi/10.1145/3617946.3617955
Weyns DCalinescu RMirandola RTei KAcosta MBennaceur ABoltz NBures TCamara JDiaconescu AEngels GGerasimou SGerostathopoulos IGetir Yaman SGrassi VHahner SLetier ELitoiu MMarsso LMusil AMusil JNunes Rodrigues GPerez-Palacin DQuin FScandurra PVallecillo AZisman A(2023)Towards a Research Agenda for Understanding and ManagingUncertainty in Self-Adaptive SystemsACM SIGSOFT Software Engineering Notes10.1145/3617946.361795148:4(20-36)Online publication date: 17-Oct-2023
https://dl.acm.org/doi/10.1145/3617946.3617951
Montoya J(2015)Open problems related to palindrome recognitionJournal of Automata, Languages and Combinatorics10.5555/3173499.317350120:1(5-25)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.5555/3173499.3173501
Lee TRomashchenko A(2005)Resource bounded symmetry of information revisitedTheoretical Computer Science10.1016/j.tcs.2005.07.017345:2-3(386-405)Online publication date: 22-Nov-2005
https://dl.acm.org/doi/10.1016/j.tcs.2005.07.017
Lee TRomashchenko A(2004)On Polynomially Time Bounded Symmetry of InformationMathematical Foundations of Computer Science 200410.1007/978-3-540-28629-5_35(463-475)Online publication date: 2004
https://doi.org/10.1007/978-3-540-28629-5_35
Bunimovich LKhlabystova M(2002)Lorentz Lattice Gases and Many-Dimensional Turing MachinesCollision-Based Computing10.1007/978-1-4471-0129-1_15(443-467)Online publication date: 2002
https://doi.org/10.1007/978-1-4471-0129-1_15
Jiang TLi MVitányi P(2002)The average-case area of Heilbronn-type trianglesRandom Structures & Algorithms10.1002/rsa.1002420:2(206-219)Online publication date: 1-Mar-2002
https://dl.acm.org/doi/10.1002/rsa.10024
Petersen H(2001)Stacks versus DequesComputing and Combinatorics10.1007/3-540-44679-6_24(218-227)Online publication date: 31-Jul-2001
https://doi.org/10.1007/3-540-44679-6_24
Reischuk KReischuk K(1999)Vergleich von SpeicherstrukturenKomplexitätstheorie Band I: Grundlagen10.1007/978-3-322-80139-5_4(183-216)Online publication date: 1999
https://doi.org/10.1007/978-3-322-80139-5_4

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations