Skip to main content
SpringerLink
Log in

Computational complexity of formal translations

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

The purpose of this paper is to define a mathematical model for the study of quantitative problems about translations between universal languages and to investigate such problems. The results derived in this paper deal with the efficiency of the translated algorithms, the optimality of translations and the complexity of the translation process between different languages.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Aho andJ. D. Ullman,The Theory of Parsing, Translation, and Compiling, Prentice-Hall, Englewood Cliffs, N.J., 1972.

    Google Scholar 

  2. M. Blum, A machine-independent theory of the complexity of recursive functions,J. Assoc. Comput. Mach. 14 (1967), 322–336.

    Google Scholar 

  3. R. L. Constable andJ. Hartmanis, Complexity of formal translations and speed-up results,Conf. Record of 3rd Annual ACM Symposium on The Theory of Computing, 1971, pp. 244–250.

  4. D. Gries,Compiler Construction for Digital Computers, Wiley & Sons, New York, 1971.

    Google Scholar 

  5. R. G. Hamlet, “Universal Abstract Programming Languages”, Computer Science Center, University of Maryland, Technical Report.

  6. J. Hartmanis andJ. E. Hopcroft, An overview of the theory of computational complexity,J. Assoc. Comput. Mach. 18 (1971), 444–475.

    Google Scholar 

  7. J. Hartmanis andT. P. Baker, On Simple Gödel Numberings and Translations, Dept. of Computer Science, Cornell University, TR 73–179, July, 1973.

  8. J. Hartmanis, On the Problem of Finding Natural Computational Complexity Measures, Dept of Computer Science, Cornell University, TR 73–175, June, 1973.

  9. H. Rogers, Jr.,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.

    Google Scholar 

  10. C. P. Schnorr, Optimal enumerations and optimal Gödel numberings,Math. Systems Theory 8 (1974), 182–191.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, 14850, Ithaca, New York, USA

    J. Hartmanis

Authors
  1. J. Hartmanis
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research has been supported in part by the National Science Foundation Grant GJ-33171X.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hartmanis, J. Computational complexity of formal translations. Math. Systems Theory 8, 156–166 (1974). https://doi.org/10.1007/BF01762186

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01762186

Keywords

Search

Navigation