{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:56Z","timestamp":1725662876880},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540088608"},{"type":"electronic","value":"9783540358077"}],"license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08860-1_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:35:47Z","timestamp":1330187747000},"page":"90-104","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Path measures of turing machine computations"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Biskup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"8_CR1","unstructured":"D.A. ALTON, \"Natural\" complexity measures, subrecursive languages, and speed-up, Computer Science report 76-05, University of Iowa, December 1976."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"D.A.ALTON, \"Natural\" complexity measures and time versus memory: some definitional proposals, Fourth Coll. Automata, Languages and Programming, Turku 1977, Lecture Notes in Computer Science 52, 16\u201329.","DOI":"10.1007\/3-540-08342-1_2"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0022-0000(71)80030-2","volume":"5","author":"G. Ausiello","year":"1971","unstructured":"G. AUSIELLO, Abstract computational complexity and cycling computations, J. Computer and System Sciences, 5 (1971), 118\u2013128.","journal-title":"J. Computer and System Sciences"},{"key":"8_CR4","first-page":"359","volume":"13","author":"J. Biskup","year":"1977","unstructured":"J. BISKUP, \u00dcber Projektionsmengen von Komplexit\u00e4tsma\u00dfen, Elektronische Informationsv. und Kybernetik (EIK), 13 (1977), 359\u2013368.","journal-title":"\u00dcber Projektionsmengen von Komplexit\u00e4tsma\u00dfen, Elektronische Informationsv. und Kybernetik (EIK)"},{"key":"8_CR5","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":"8_CR6","volume-title":"Theory of computation","author":"W. S. Brainerd","year":"1974","unstructured":"W.S. BRAINERD\/L.H. LANDWEBER, Theory of computation, Wiley-Interscience, New York, 1974."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"R. L. CONSTABLE, Type two computational complexity, Proc.Fifth Ann.ACM Symp. Theory of Computing (1973), 108\u2013121.","DOI":"10.1145\/800125.804041"},{"key":"8_CR8","volume-title":"Automata, languages and machines, vol.A","author":"S. Eilenberg","year":"1974","unstructured":"S. EILENBERG, Automata, languages and machines, vol.A, Academic Press, New York-London, 1974."},{"key":"8_CR9","unstructured":"J. HARTMANIS, On the problem of finding natural computational complexity measures, Proc. Int. Symp. and Summer School Math. Foundations of Computer Science, High Tatra, Sept. 3\u20138 (1973), 95\u2013103."},{"key":"8_CR10","volume-title":"The art of computer programming, Vol. 1","author":"D. E. Knuth","year":"1968","unstructured":"D.E. KNUTH, The art of computer programming, Vol. 1, Addison-Wesley, Reading (Mass.), 1968, 1973."},{"key":"8_CR11","first-page":"423","volume":"11","author":"G. Lischke","year":"1975","unstructured":"G. LISCHKE, Flu\u00dfbildma\u00dfe \u2014 Ein Versuch zur Definition nat\u00fcrlicher Kompliziert-heitsma\u00dfe, Elektronische Informationsv. und Kybernetik (EIK), 11 (1975), 423\u2013436.","journal-title":"Elektronische Informationsv. und Kybernetik (EIK)"},{"key":"8_CR12","unstructured":"K. WEIHRAUCH, \u00dcber Eigenschaften abstrakter Komplexit\u00e4tsma\u00dfe von Algorithmen, Seminarbericht Nr. 34 der GMD, Birlinghoven, 1971."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08860-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:15:24Z","timestamp":1578528924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08860-1_8"}},"subtitle":["preliminary report"],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540088608","9783540358077"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-08860-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}