{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:21:57Z","timestamp":1649067717092},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8417,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,7]]},"DOI":"10.1016\/0304-3975(90)90181-g","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"313-317","source":"Crossref","is-referenced-by-count":0,"title":["Strong time bounds: Non-computable bounds and a hierarchy theorem"],"prefix":"10.1016","volume":"73","author":[{"given":"J.M.","family":"Robson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90181-G_BIB1","doi-asserted-by":"crossref","unstructured":"L. Blum, M. Shub and S. Smale, On a theory of computation over the real numbers; NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc., to appear.","DOI":"10.1109\/SFCS.1988.21955"},{"key":"10.1016\/0304-3975(90)90181-G_BIB2","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","article-title":"Time bounded random access machines","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90181-G_BIB3_1","first-page":"279","article-title":"Enumerable sets are Diophantine","volume":"191","author":"Matijasevic","year":"1970","journal-title":"Dokl. Akad. Nauk. U.S.S.R."},{"key":"10.1016\/0304-3975(90)90181-G_BIB3_2","first-page":"354","volume":"11","author":"Matijasevic","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(90)90181-G_BIB4","series-title":"Proc. 6th Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"1","article-title":"On genuinely time bounded computations","author":"Meyer auf der Heide","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090181G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090181G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:40Z","timestamp":1555127500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090181G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["030439759090181G"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90181-g","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}