{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:56:30Z","timestamp":1725494190650},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664123"},{"type":"electronic","value":"9783540483212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48321-7_36","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T12:57:55Z","timestamp":1194267475000},"page":"433-440","source":"Crossref","is-referenced-by-count":0,"title":["\u03b4-Uniformly decidable sets and turing machines"],"prefix":"10.1007","author":[{"given":"Adriana","family":"Popovici","sequence":"first","affiliation":[]},{"given":"Dan","family":"Popovici","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. (N.S.) 21 (1989) 1\u201346","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/jcom.1998.0475","volume":"14","author":"P. Boldi","year":"1998","unstructured":"Boldi, P., Vigna, S.: \u03b4-uniform BSS machines. J. Complexity 14 (1998) 234\u2013256","journal-title":"J. Complexity"},{"key":"36_CR3","volume-title":"Point set topology. Pure and Applied Mathematics","author":"S.A. Gaal","year":"1964","unstructured":"Gaal, S.A.: Point set topology. Pure and Applied Mathematics, Academic Press, Boston (1964)"},{"key":"36_CR4","unstructured":"Lang, S.: Algebra. Addison-Wesley (1971)"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42 (1936) 230\u2013265. A correction 43 544\u2013546","journal-title":"Proc. London Math. Soc."},{"key":"36_CR6","volume-title":"Algebra","author":"B.L. Waerden van der","year":"1971","unstructured":"van der Waerden, B.L.: Algebra. Springer-Verlag, Berlin, eighth edition (1971)","edition":"eighth edition"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(85)90207-5","volume":"38","author":"K. Weihrauch","year":"1985","unstructured":"Weihrauch, K.: Type 2 recursion theory. Theoret. Comput. Sci. 38 (1985) 17\u201333","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48321-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T01:12:08Z","timestamp":1548378728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48321-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664123","9783540483212"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-48321-7_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}