{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T05:43:32Z","timestamp":1649051012757},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1974,6,1]],"date-time":"1974-06-01T00:00:00Z","timestamp":139276800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1974,6]]},"DOI":"10.1007\/bf01762186","type":"journal-article","created":{"date-parts":[[2005,6,15]],"date-time":"2005-06-15T19:23:54Z","timestamp":1118863434000},"page":"156-166","source":"Crossref","is-referenced-by-count":4,"title":["Computational complexity of formal translations"],"prefix":"10.1007","volume":"8","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01762186_CR1","volume-title":"The Theory of Parsing, Translation, and Compiling","author":"A. V. Aho","year":"1972","unstructured":"A. V. Aho andJ. D. Ullman,The Theory of Parsing, Translation, and Compiling, Prentice-Hall, Englewood Cliffs, N.J., 1972."},{"key":"BF01762186_CR2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"M. Blum, A machine-independent theory of the complexity of recursive functions,J. Assoc. Comput. Mach. 14 (1967), 322\u2013336.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01762186_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013250.","DOI":"10.1145\/800157.805053"},{"key":"BF01762186_CR4","volume-title":"Compiler Construction for Digital Computers","author":"D. Gries","year":"1971","unstructured":"D. Gries,Compiler Construction for Digital Computers, Wiley & Sons, New York, 1971."},{"key":"BF01762186_CR5","unstructured":"R. G. Hamlet, \u201cUniversal Abstract Programming Languages\u201d, Computer Science Center, University of Maryland, Technical Report."},{"key":"BF01762186_CR6","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/321650.321661","volume":"18","author":"J. Hartmanis","year":"1971","unstructured":"J. Hartmanis andJ. E. Hopcroft, An overview of the theory of computational complexity,J. Assoc. Comput. Mach. 18 (1971), 444\u2013475.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01762186_CR7","unstructured":"J. Hartmanis andT. P. Baker, On Simple G\u00f6del Numberings and Translations, Dept. of Computer Science, Cornell University, TR 73\u2013179, July, 1973."},{"key":"BF01762186_CR8","unstructured":"J. Hartmanis, On the Problem of Finding Natural Computational Complexity Measures, Dept of Computer Science, Cornell University, TR 73\u2013175, June, 1973."},{"key":"BF01762186_CR9","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"H. Rogers, Jr.,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967."},{"key":"BF01762186_CR10","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/BF01762189","volume":"8","author":"C. P. Schnorr","year":"1974","unstructured":"C. P. Schnorr, Optimal enumerations and optimal G\u00f6del numberings,Math. Systems Theory 8 (1974), 182\u2013191.","journal-title":"Math. Systems Theory"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762186.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01762186\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:11:47Z","timestamp":1586286707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01762186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,6]]}},"alternative-id":["BF01762186"],"URL":"https:\/\/doi.org\/10.1007\/bf01762186","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,6]]}}}