{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:12Z","timestamp":1725662892450},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540091189"},{"type":"electronic","value":"9783540355175"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09118-1_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:41:49Z","timestamp":1330188109000},"page":"58-66","source":"Crossref","is-referenced-by-count":1,"title":["Information content characterizations of complexity theoretic properties"],"prefix":"10.1007","author":[{"given":"Victor L.","family":"Bennison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"8_CR1","unstructured":"V. Bennison, On the computational complexity of recursively enumerable sets, Ph.D. Dissertation, University of Chicago, 1976."},{"key":"8_CR2","unstructured":"___________, Recursively enumerable complexity sequences and measure independence, preprint to appear."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(78)90007-5","volume":"6","author":"V. Bennison","year":"1978","unstructured":"V. Bennison and R.I. Soare, Some lowness properties and computational complexity sequences, J. Theoretical Computer Science 6 (1978) 233\u2013254.","journal-title":"J. Theoretical Computer Science"},{"key":"8_CR4","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. for Computing Machinery 14 (1967), 322\u2013336.","journal-title":"J. Assoc. for Computing Machinery"},{"key":"8_CR5","unstructured":"_______, On defining the complexity of partial recursive functions, preprint."},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"579","DOI":"10.2307\/2271984","volume":"38","author":"M. Blum","year":"1973","unstructured":"M. Blum and I. Marques, On complexity properties of recursively enumerable sets, J. Symbolic Logic 38 (1973), 579\u2013593.","journal-title":"J. Symbolic Logic"},{"key":"8_CR7","unstructured":"I. Filotti, On effectively levelable sets, Recursive Function Newsletter No. 2 (1972), 12\u201313."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0022-0000(71)80007-7","volume":"5","author":"J. Hartmanis","year":"1971","unstructured":"J. Hartmanis and F.D. Lewis, The use of lists in the study of undecidable problems in automata theory, J. Computer and Systems Science 5 (1971), 54\u201366.","journal-title":"J. Computer and Systems Science"},{"key":"8_CR9","volume-title":"Complexity properties of recursively enumerable sets","author":"I. Marques","year":"1973","unstructured":"I. Marques, Complexity properties of recursively enumerable sets, Ph.D. Dissertation, University of California, Berkeley, 1973."},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2272545","volume":"37","author":"A. R. Meyer","year":"1972","unstructured":"A.R. Meyer and P.C. Fischer, Computational speed-up by effective operators, J. Symbolic Logic 37 (1972), 55\u201368.","journal-title":"J. Symbolic Logic"},{"key":"8_CR11","volume-title":"Complexity theoretic properties of recursively enumerable sets","author":"P. H. Morris","year":"1974","unstructured":"P.H. Morris, Complexity theoretic properties of recursively enumerable sets, Ph.D. Dissertation, University of California, Irvine, 1974."},{"key":"8_CR12","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":"8_CR13","doi-asserted-by":"crossref","first-page":"545","DOI":"10.2307\/2271876","volume":"42","author":"R. I. Soare","year":"1977","unstructured":"R.I. Soare, Computational complexity, speedable and levelable sets, J. Symbolic Logic 42 (1977), 545\u2013563.","journal-title":"J. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science 4th GI Conference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09118-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:58:19Z","timestamp":1619557099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09118-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540091189","9783540355175"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-09118-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}