Skip to main content
SpringerLink
Log in

Juris Hartmanis: The Beginnings of Computational Complexity

  • Chapter
Complexity Theory Retrospective

Abstract

I wish to commend the organizing committee for the 1988 Structures Symposium on their plan to honor Juris Hartmanis with this series of talks on his career2. This is a very appropriate tribute since complexity theory is now approximately 25 years old and Juris has been a prime mover in the field throughout its history. I was privileged to have worked with Hartmanis during the early period of his complexity research, and I am grateful for this opportunity to reminisce about this time period and the beginnings of complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Blum. A machine-independent theory of the complexity of recursive functions. J. ACM, 14, 2: 322–336, April 1967.

    Article  MATH  Google Scholar 

  2. Y. Bar-Hillel, M. Perles, and E. Shamir. On formal properties of simple phrase structure grammars. Z. Phonetik, Sprach. Komm., 14: 143–179, 1961.

    MathSciNet  MATH  Google Scholar 

  3. N. Chomsky. On certain formal properties of grammars. Information and Control, 2: 136–167, 1959.

    Google Scholar 

  4. S.A. Cook. An overview of computational complexity. Communications of ACM, 26, 6: 401–402, June 1983.

    Article  Google Scholar 

  5. Curriculum 68 — Recommendations for Academic Problems in Computer Science — A Report of the A CM Curriculum Committee on Computer Science, 1968. Communications of ACM, vol. 11, 3, page 151–197.

    Google Scholar 

  6. M. Davis. Computability and Unsolvability. McGraw-Hill, New York, 1958.

    MATH  Google Scholar 

  7. J. Hartmanis. On the state assignment problem for sequential machines I. IRE Trans. Elec. Comp., 10: 157–165, 1961.

    Article  MathSciNet  Google Scholar 

  8. J. Hartmanis. Observations about the development of theoretical computer science. Annals of the History of Computing, 3, 1: 42–51, January 1981.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Hartmanis, P.M. Lewis, and R.E. Stearns. Classification of computations by time and memory requirements. In Proc. of IFIP Congress, pages 31–35, 1965.

    Google Scholar 

  10. J. Hartmanis and R.E. Stearns. Some dangers in state reduction of sequential machines. Information and Control, 5, 3: 252–260, September 1962.

    Article  MathSciNet  MATH  Google Scholar 

  11. J. Hartmanis and R.E. Stearns. A study of feedback and errors in sequential machines. IEEE Transactions on Electronic Computers, EC-12, 3, June 1963.

    Google Scholar 

  12. J. Hartmanis and R.E. Stearns. Compuational complexity of recursive sequences. In Proc. Fifth Annual Symp. on Switching Theory and Logical Design, Princeton, NJ, 1964.

    Google Scholar 

  13. J. Hartmanis and R.E. Stearns. Pair algebra and its application to automata theory. Information and Control, 7, 4: 485–507, December 1964.

    Article  MathSciNet  Google Scholar 

  14. J. Hartmanis and R.E. Stearns. On the computational complexity of algorithms. Transactions of American Mathematical Society, 117, 5: 285–306, May 1965.

    Article  MathSciNet  MATH  Google Scholar 

  15. J. Hartmanis and R.E. Stearns. Algebraic Structure Theory of Sequential Machines. Prentice-Hall, 1966.

    MATH  Google Scholar 

  16. F.C. Hennie and R.E. Stearns. Two-tape simulation of multitape turing machines. Journal of ACM, 13, 4: 533–546, October 1966.

    Article  MathSciNet  MATH  Google Scholar 

  17. R.M. Karp. Combinatorics, complexity, and randomness. Communications of ACM, 29, 2: 103, February 1986.

    Article  MathSciNet  Google Scholar 

  18. P.M. Lewis, R.E. Stearns, and J. Hartmanis. Memory bounds for recognition of context free and context sensitive languages. In Proc. 6th Annual Symp. on Switching Circuit Theory and Logical Design, pages 191–202, October 1965.

    Google Scholar 

  19. J. Myhill. Linear Bounded Automata. Technical Report No. 60-22, University of Pennsylvania, 1960.

    Google Scholar 

  20. M.O. Rabin. Speed of computation and classification of recursive sets. In Third Convention Science Society, pages 1–2, Israel, 1959.

    Google Scholar 

  21. M.O. Rabin. Degree of Difficulty of Computing a Function and a Partial Ordering of Recursive Sets. Technical Report No. 2, Hebrew University, Jerusalem, 1960.

    Google Scholar 

  22. R.W. Ritchie. Classes of predictably computable functions. Trans. American Mathematical Society, 106: 139–173, 1963.

    Article  MathSciNet  MATH  Google Scholar 

  23. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal on Research, 3: 115–125, 1959.

    MathSciNet  Google Scholar 

  24. W.J. Savitch. Relations between nondeterministic and deterministic tape complexities. J. Comp. and Sys. Sciences, 4: 177–192, 1970.

    Article  MathSciNet  MATH  Google Scholar 

  25. S. Scheinberg. Note on the boolean properties of context-free languages. Information and Control, 3: 373–375, 1960.

    Article  MathSciNet  Google Scholar 

  26. R.E. Stearns and J. Hartmanis. On the state assignment problem for sequential machines II. IRE Transactions on Electronic Computers, EC-10, 4: 593–603, December 1961.

    Google Scholar 

  27. C.E. Shannon. Mathematical theory of communication. Bell Sys. Tech. Journal, 17: 379–423, 623–658, 1948.

    MathSciNet  Google Scholar 

  28. R.E. Stearns, J. Hartmanis, and P.M. Lewis. Hierarchies of memory limited computations. Proc. 6th Annual Symp. on Switching Circuit Theory and Logical Design, 179–190, October 1965.

    Google Scholar 

  29. H. Yamada. Real-time computation and recursive functions not real-time computable. IRE Trans. Elec. Comp., EC-11: 753–760, 1962.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University at Albany - SUNY, Albany, New York, 12222, USA

    Richard E. Stearns

Authors
  1. Richard E. Stearns
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computer Science, Northeastern University, Boston, MA, 02115, USA

    Alan L. Selman

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Stearns, R.E. (1990). Juris Hartmanis: The Beginnings of Computational Complexity. In: Selman, A.L. (eds) Complexity Theory Retrospective. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4478-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4478-3_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-8793-3

  • Online ISBN: 978-1-4612-4478-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation