|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6034
| Title: | Computational Complexity of Formal Translations |
| Authors: | Hartmanis, Juris |
| Keywords: | computer science
technical report |
| Issue Date: | Dec-1973 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-192 |
| 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. |
| URI: | http://hdl.handle.net/1813/6034 |
| Appears in Collections: | Computer Science Technical Reports
Hartmanis, Juris
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
