{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:21Z","timestamp":1725488001572},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_60","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T11:16:31Z","timestamp":1185275791000},"page":"575-584","source":"Crossref","is-referenced-by-count":8,"title":["Locally Computable Structures"],"prefix":"10.1007","author":[{"given":"Russell G.","family":"Miller","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"60_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. Bulletin of the AMS\u00a021, 1\u201346 (1989)","journal-title":"Bulletin of the AMS"},{"issue":"3","key":"60_CR2","first-page":"318","volume":"53","author":"M. Braverman","year":"2006","unstructured":"Braverman, M., Cook, S.: Computing over the Reals: Foundations for Scientific Computing. Notices of the AMS\u00a053(3), 318\u2013329 (2006)","journal-title":"Notices of the AMS"},{"key":"60_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0049-237X(98)80002-5","volume-title":"Pure computable model theory, Handbook of Recursive Mathematics","author":"V.S. Harizanov","year":"1998","unstructured":"Harizanov, V.S.: Pure computable model theory, Handbook of Recursive Mathematics, vol.\u00a01, pp. 3\u2013114. Elsevier, Amsterdam (1998)"},{"key":"60_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R.I. Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, New York (1987)"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T05:18:05Z","timestamp":1550467085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}