Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. Computational Complexity of Formal Translations

Computational Complexity of Formal Translations

File(s)
73-192.ps (432.29 KB)
73-192.pdf (1.07 MB)
Permanent Link(s)
https://hdl.handle.net/1813/6034
Collections
Computer Science Technical Reports
Hartmanis, Juris
Author
Hartmanis, Juris
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. Keywords: universal languages, Goedel numberings, translations, complexity of translations, optimality, length of translated programs.

Date Issued
1973-12
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-192
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance