{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T21:30:42Z","timestamp":1695850242251},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"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":7990,"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":[[1991,9]]},"DOI":"10.1016\/0304-3975(91)90331-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"347-352","source":"Crossref","is-referenced-by-count":6,"title":["Relativized topological size of sets of partial recursive functions"],"prefix":"10.1016","volume":"87","author":[{"given":"Cristian","family":"Calude","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90331-U_BIB1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/malq.19820282707","article-title":"Topological size of sets of partial recursive functions","volume":"28","author":"Calude","year":"1982","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(91)90331-U_BIB2","series-title":"Theories of Computational Complexity","author":"Calude","year":"1988"},{"key":"10.1016\/0304-3975(91)90331-U_BIB3","first-page":"46","article-title":"Topological size of the set of boolean-valued partial recursive functions","volume":"2","author":"Istrate","year":"1989","journal-title":"An. Univ. Bucuresti Mat.-Inf."},{"key":"10.1016\/0304-3975(91)90331-U_BIB4","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/SWAT.1973.23","article-title":"On the size of sets of computable functions","author":"Mehlhorn","year":"1973","journal-title":"Ann. IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(91)90331-U_BIB5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/malq.19850311410","article-title":"A note on conjectures of Calude about topological size of sets of partial recursive functions","volume":"31","author":"Sch\u00e4fer","year":"1985","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(91)90331-U_BIB6","first-page":"346","article-title":"Baire classification and partial recursive functions","volume":"32","author":"Zimand","year":"1984","journal-title":"Recursive Function Theory: Newsletter"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190331U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190331U?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:55:04Z","timestamp":1555127704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190331U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["030439759190331U"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90331-u","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}