{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:01:12Z","timestamp":1726452072540},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90129-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"101-123","source":"Crossref","is-referenced-by-count":13,"title":["Reducibilities on real numbers"],"prefix":"10.1016","volume":"31","author":[{"given":"Ker-I","family":"Ko","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90129-4_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P=?NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(84)90129-4_BIB2","article-title":"On the computational complexity of maximation and integration","author":"Friedman","year":"1984","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/0304-3975(84)90129-4_BIB3","series-title":"Constructivity in Mathematics","first-page":"43","article-title":"Some approaches to constructive analysis","author":"Grzegorczyk","year":"1959"},{"key":"10.1016\/0304-3975(84)90129-4_BIB4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(84)90129-4_BIB5","series-title":"Tech. Rept. No. UH-CS-81-6","article-title":"On NP real functions","author":"Ko","year":"1981"},{"key":"10.1016\/0304-3975(84)90129-4_BIB6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0022-0000(82)90053-8","article-title":"The maximum value problem and NP real numbers","volume":"24","author":"Ko","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(84)90129-4_BIB7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01744572","article-title":"On the definitions of some complexity classes of real numbers","volume":"6","author":"Ko","year":"1983","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(84)90129-4_BIB8","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","article-title":"Computational complexity of real functions","volume":"20","author":"Ko","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(84)90129-4_BIB9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.4064\/fm-44-1-37-51","article-title":"On computable sequences","volume":"44","author":"Mostowski","year":"1957","journal-title":"Fund. Math."},{"key":"10.1016\/0304-3975(84)90129-4_BIB10","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1090\/S0002-9939-1954-0063328-5","article-title":"Recursive real numbers","volume":"5","author":"Rice","year":"1954","journal-title":"Proc. Amer. Math. Soc."},{"year":"1967","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","key":"10.1016\/0304-3975(84)90129-4_BIB11"},{"key":"10.1016\/0304-3975(84)90129-4_BIB12","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0022-0000(81)90068-4","article-title":"Some observations on NP real numbers and p-selective sets","volume":"23","author":"Selman","year":"1981","journal-title":"J. Comput. System"},{"key":"10.1016\/0304-3975(84)90129-4_BIB13","first-page":"271","article-title":"Recursion theory and Dedekind cuts","volume":"140","author":"Soare","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(84)90129-4_BIB14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.2307\/2267043","article-title":"Nicht konstuktiv beweisbare Satze der Analysis","volume":"14","author":"Specker","year":"1949","journal-title":"J. Symbol Logic"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901294?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901294?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:28:26Z","timestamp":1580902106000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584901294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584901294"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90129-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1984]]}}}