{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T15:50:38Z","timestamp":1718380238004},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1007\/bf01744572","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T04:56:39Z","timestamp":1118897799000},"page":"95-109","source":"Crossref","is-referenced-by-count":53,"title":["On the definitions of some complexity classes of real numbers"],"prefix":"10.1007","volume":"16","author":[{"given":"Ker-I","family":"Ko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01744572_CR1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","volume":"26","author":"R. Book","year":"1974","unstructured":"R. Book, Tally languages and complexity classes,Information and Control, 26, 186\u2013183 (1974).","journal-title":"Information and Control"},{"key":"BF01744572_CR2","first-page":"63","volume-title":"Lecture Notes in Computer Science, 62","author":"P. Berman","year":"1978","unstructured":"P. Berman, Relationship between density and deterministic complexity of NP-complete languages, Fifth International Coll. Auto. Lang. Programming,Lecture Notes in Computer Science, 62, Springer, New York (1978) pp. 63\u201371."},{"key":"BF01744572_CR3","first-page":"43","volume-title":"Constructivity in Mathematics","author":"A. Grzegorcyzk","year":"1956","unstructured":"A. Grzegorcyzk, Some approaches to constructive analysis, inConstructivity in Mathematics, A. Heyting ed., North-Holland, Amsterdam (1956) pp. 43\u201361."},{"key":"BF01744572_CR4","first-page":"1","volume":"7","author":"J. Hartmanis","year":"1974","unstructured":"J. Hartmanis and H. B. Hunt, III, The LBA problem and its importance in the theory of computing,SIAM-AMS Proc., 7, 1\u201326 (1974).","journal-title":"SIAM-AMS Proc."},{"key":"BF01744572_CR5","volume-title":"Computational complexity of real functions and polynomial time approximation","author":"K. Ko","year":"1979","unstructured":"K. Ko, Computational complexity of real functions and polynomial time approximation, Ph.D. Thesis, The Ohio State University, Columbus, Ohio (1979)."},{"key":"BF01744572_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0022-0000(82)90053-8","volume":"24","author":"K. Ko","year":"1982","unstructured":"K. Ko, The maximum value problem and NP real numbers,J. Comput. System Sci., 24, 15\u201335 (1982).","journal-title":"J. Comput. System Sci."},{"key":"BF01744572_CR7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"K. Ko","year":"1982","unstructured":"K. Ko and H. Friedman, Computational complexity of real functions,Theoret. Comput. Sci., 20, 323\u2013352 (1982).","journal-title":"Theoret. Comput. Sci."},{"key":"BF01744572_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"R. Ladner","year":"1975","unstructured":"R. Ladner, N. Lynch and A. L. Selman, A comparison of polynomial-time reducibilities,Theoret. Comput. Sci., 1, 103\u2013213 (1975).","journal-title":"Theoret. Comput. Sci."},{"key":"BF01744572_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.4064\/fm-44-1-37-51","volume":"44","author":"A. Mostowski","year":"1957","unstructured":"A. Mostowski, On computable sequences,Fund. Math., 44, 37\u201351 (1957).","journal-title":"Fund. Math."},{"key":"BF01744572_CR10","first-page":"178","volume-title":"Constructivity in Mathematics","author":"A. Mostowski","year":"1959","unstructured":"A. Mostowski, On various degrees of constructivism, inConstructivity in Mathematics, A. Heyting, ed., North Holland, Amsterdam, (1959), pp. 178\u2013194."},{"key":"BF01744572_CR11","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1090\/S0002-9939-1954-0063328-5","volume":"5","author":"H. G. Rice","year":"1954","unstructured":"H. G. Rice, Recursive real numbers,Proc. Amer. Math. Soc., 5, 784\u2013791 (1954).","journal-title":"Proc. Amer. Math. Soc."},{"key":"BF01744572_CR12","first-page":"280","volume":"16","author":"R. M. Robinson","year":"1951","unstructured":"R. M. Robinson, Review of R. Peter's book, Rekursive Funktionen,J. Symb. Log., 16, 280\u2013282 (1951).","journal-title":"J. Symb. Log."},{"key":"BF01744572_CR13","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":"BF01744572_CR14","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/322047.322061","volume":"25","author":"J. I. Seiferas","year":"1978","unstructured":"J. I. Seiferas, M. I. Fischer and A. R. Meyer, Separating nondeterministic time complexity classes,J. Assoc. Comput. Mach., 25, 146\u2013167 (1978).","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01744572_CR15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","volume":"13","author":"A. L. Selman","year":"1979","unstructured":"A. L. Selman,P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP,Math. Systems Theory, 13, 55\u201365 (1979).","journal-title":"Math. Systems Theory"},{"key":"BF01744572_CR16","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0022-0000(81)90068-4","volume":"23","author":"A. L. Selman","year":"1981","unstructured":"A. L. Selman, Some observations on NP real numbers and P-selective sets,J. Comput. System Sci., 23, 326\u2013332 (1981).","journal-title":"J. Comput. System Sci."},{"key":"BF01744572_CR17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E. Specker","year":"1949","unstructured":"E. Specker, Nicht konstruktiv beweisbare S\u00e4tze der Analysis,J. Symb. Log., 14, 145\u2013158 (1949).","journal-title":"J. Symb. Log."},{"key":"BF01744572_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. J. Stockmeyer","year":"1977","unstructured":"L. J. Stockmeyer. The polynomial time hierarchy,Theoret. Comput. Sci., 3, 1\u201322 (1977).","journal-title":"Theoret. Comput. Sci."},{"key":"BF01744572_CR19","first-page":"430","volume":"42","author":"A. M. Turing","year":"1937","unstructured":"A. M. Turing, On computable numbers, with an application to the Entscheidungs problems,Proc. London Math. Soc., 42, 430\u2013265 (1937).","journal-title":"Proc. London Math. Soc."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01744572.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01744572\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01744572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T11:00:34Z","timestamp":1557313234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01744572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["BF01744572"],"URL":"https:\/\/doi.org\/10.1007\/bf01744572","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}