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.
Similar content being viewed by others
References
A. V. Aho andJ. D. Ullman,The Theory of Parsing, Translation, and Compiling, Prentice-Hall, Englewood Cliffs, N.J., 1972.
M. Blum, A machine-independent theory of the complexity of recursive functions,J. Assoc. Comput. Mach. 14 (1967), 322–336.
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.
D. Gries,Compiler Construction for Digital Computers, Wiley & Sons, New York, 1971.
R. G. Hamlet, “Universal Abstract Programming Languages”, Computer Science Center, University of Maryland, Technical Report.
J. Hartmanis andJ. E. Hopcroft, An overview of the theory of computational complexity,J. Assoc. Comput. Mach. 18 (1971), 444–475.
J. Hartmanis andT. P. Baker, On Simple Gödel Numberings and Translations, Dept. of Computer Science, Cornell University, TR 73–179, July, 1973.
J. Hartmanis, On the Problem of Finding Natural Computational Complexity Measures, Dept of Computer Science, Cornell University, TR 73–175, June, 1973.
H. Rogers, Jr.,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
C. P. Schnorr, Optimal enumerations and optimal Gödel numberings,Math. Systems Theory 8 (1974), 182–191.
Author information
Authors and Affiliations
Additional information
This research has been supported in part by the National Science Foundation Grant GJ-33171X.
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01762186