article

Free access

On Time Versus Space

Authors:

John Hopcroft,

Wolfgang Paul,

Leslie ValiantAuthors Info & Claims

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

Pages 332 - 337

https://doi.org/10.1145/322003.322015

Published: 01 April 1977 Publication History

PDF eReader

Abstract

It is shown that every deterministic multitape Turing machine of time complexity t(n) can be simulated by a deterministic Turing machine of tape complexity t(n)/logt(n). Consequently, for tape constructable t(n), the class of languages recognizable by multitape Turing machines of time complexity t(n) is strictly contained in the class of languages recognized by Turing machines of tape complexity t(n). In particular the context-sensitive languages cannot be recognized in linear time by deterministic multitape Turing machines.

References

[1]

Ano, A.V, HOPCROIrr, }.E., ar~t~ ULLMAN, J D. The Design and Analysis of Computer Algorithms Addison-Wesley, Reading, Mass, 1974

Crossref

Google Scholar

[2]

CooK. S A An observation of time-storage trade-off Proc. Fifth Annual ACM Syrup. on Theory of Comput, 1973, pp. 29-33

Crossref

Google Scholar

[3]

I'-IARTMANIS, J, AND STEARNS, R E On the computational complexity of algorithms. Trans. Amer Math Soc 117 (1965), 285-306

Google Scholar

[4]

HENNIE, F.C On-line Turlng machine computations IEEE Trans. Electronic Computers EC-15 (1966), 35-44

Google Scholar

[5]

HENNIE, F C, AND STEARNS, R E Two-tape simulation of multltape Turmg machines. J ACM 13, 4 (Oct 1966), 533-546

Crossref

Google Scholar

[6]

HoPCROrr, J E, ANn ULLMAN, J D Some results on tape-bounded Turlng machines. J ACM 16, 1 (Jan 1969), 168-177

Crossref

Google Scholar

[7]

HoPcRovr, J E, AND ULLMAN, J D Formal Languages and Their Relation to Automata. Addison- Wesley, Reading, Mass, 1969

Crossref

Google Scholar

[8]

PATERSON, M S Tape bounds for time-bounded Turlng machines. J Computer System Sct. 6 (1972), 116-124

Google Scholar

[9]

PATERSON, M S, ANt) VALIANT, L G Clrcmt size is nonlinear in depth Theory of Comput. Rep. 8, U of Warwick. Coventry, England, 1975, to appear in Theoretical Computer Scl

Crossref

Google Scholar

[10]

SAvrrcn, W J Relationships between nondetermlnlst~c and deterministic tape complexltleg. J. Computer System Sct 4, 2 (1970), 117-192

Google Scholar

[11]

STEARNS, R E, HARTMANIS, J, AND LEWIS, P M Hierarchies of memory hmited computations Proc Sixth IEEE Syrup. on Switching and Automata Theory, 1965, pp. 191-202.

Google Scholar

Cited By

View all

Cook JMertz IMohar BShinkar IO'Donnell R(2024)Tree Evaluation Is in Space 𝑂 (log 𝑛 · log log 𝑛)Proceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649664(1268-1278)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649664
Hurlbert GSeddiq E(2024)On the Target Pebbling ConjectureCombinatorics, Graph Theory and Computing10.1007/978-3-031-52969-6_16(163-176)Online publication date: 16-Jun-2024
https://doi.org/10.1007/978-3-031-52969-6_16
Blocki JHolman BLee S(2022)The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFsTheory of Cryptography10.1007/978-3-031-22318-1_3(52-79)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-22318-1_3
Show More Cited By

Index Terms

On Time Versus Space
1. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Models of computation
    1. Computability
      1. Turing machines

Recommendations

On Time Versus Space
Two-way unary automata versus logarithmic space

We show that if L=NL (the classical logarithmic space classes), then each unary 2nfa (a two-way nondeterministic finite automaton) can be converted into an equivalent 2dfa (a deterministic two-way automaton), keeping the number of states polynomial. (...
Two-way unary automata versus logarithmic space
DLT'10: Proceedings of the 14th international conference on Developments in language theory

We show that each n-state unary 2nfa (a two-way nondeterministic finite automaton) can be simulated by an equivalent 2ufa (an unambiguous 2nfa) with a polynomial number of states. Moreover, if L = NL (the classical logarithmic space classes), then each ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 24, Issue 2

April 1977

174 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322003

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1977

Published in JACM Volume 24, 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

182
Total Citations
View Citations
2,524
Total Downloads

Downloads (Last 12 months)403
Downloads (Last 6 weeks)39

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cook JMertz IMohar BShinkar IO'Donnell R(2024)Tree Evaluation Is in Space 𝑂 (log 𝑛 · log log 𝑛)Proceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649664(1268-1278)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649664
Hurlbert GSeddiq E(2024)On the Target Pebbling ConjectureCombinatorics, Graph Theory and Computing10.1007/978-3-031-52969-6_16(163-176)Online publication date: 16-Jun-2024
https://doi.org/10.1007/978-3-031-52969-6_16
Blocki JHolman BLee S(2022)The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFsTheory of Cryptography10.1007/978-3-031-22318-1_3(52-79)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-22318-1_3
Blocki JHolman B(2022)Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent Memory-Hard FunctionsAdvances in Cryptology – CRYPTO 202210.1007/978-3-031-15982-4_8(222-251)Online publication date: 15-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-15982-4_8
De Rezende SMeir ONordström JRobere R(2021)Nullstellensatz Size-Degree Trade-offs from Reversible Pebblingcomputational complexity10.1007/s00037-020-00201-y30:1Online publication date: 12-Feb-2021
https://doi.org/10.1007/s00037-020-00201-y
Papp PWattenhofer RScheideler CSpear M(2020)On the Hardness of Red-Blue Pebble GamesProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400278(419-429)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400278
de Rezende SNordström JMeir ORobere RAceto L(2019)Nullstellensatz size-degree trade-offs from reversible pebblingProceedings of the 34th Computational Complexity Conference10.4230/LIPIcs.CCC.2019.18(1-16)Online publication date: 17-Jul-2019
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2019.18
Williams R(2019)Some Estimated Likelihoods for Computational ComplexityComputing and Software Science10.1007/978-3-319-91908-9_2(9-26)Online publication date: 2019
https://doi.org/10.1007/978-3-319-91908-9_2
Bilardi GScquizzato MSilvestri F(2018)A Lower Bound Technique for Communication in BSPACM Transactions on Parallel Computing10.1145/31817764:3(1-27)Online publication date: 20-Feb-2018
https://dl.acm.org/doi/10.1145/3181776
Alwen JBlocki JPietrzak K(2018)Sustained Space ComplexityAdvances in Cryptology – EUROCRYPT 201810.1007/978-3-319-78375-8_4(99-130)Online publication date: 31-Mar-2018
https://doi.org/10.1007/978-3-319-78375-8_4
Show More Cited By

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