{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T18:18:58Z","timestamp":1726424338063},"reference-count":42,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":5191,"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":[[1999,5]]},"DOI":"10.1016\/s0304-3975(98)00289-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:38:06Z","timestamp":1027589886000},"page":"185-223","source":"Crossref","is-referenced-by-count":8,"title":["On approximate and algebraic computability over the real numbers"],"prefix":"10.1016","volume":"219","author":[{"given":"Armin","family":"Hemmerling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1998","series-title":"Complexity and Real Computation","author":"Blum","key":"10.1016\/S0304-3975(98)00289-8_BIB1"},{"issue":"1","key":"10.1016\/S0304-3975(98)00289-8_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines","volume":"21","author":"Blum","year":"1989","journal-title":"Bull. AMS"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB3","article-title":"\u03b4-uniform BSS machines","author":"Boldi","year":"1997","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB4_1","article-title":"Feasible real random access machines","volume":"193","author":"Brattka","year":"1995"},{"journal-title":"Theoret. Comput. Sci.","year":"1998","author":"Brattka","key":"10.1016\/S0304-3975(98)00289-8_BIB4_2"},{"issue":"3","key":"10.1016\/S0304-3975(98)00289-8_BIB5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1093\/logcom\/2.3.375","article-title":"The arithmatical hierarchy over the reals","volume":"2","author":"Cucker","year":"1992","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0304-3975(98)00289-8_BIB6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.2307\/2274424","article-title":"Alfred Tarski's elimination theory for real closed fields","volume":"53","author":"van den Dries","year":"1988","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01705528","article-title":"Algorithmic properties of structures","volume":"1","author":"Engeler","year":"1967","journal-title":"Math. System Theory"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB8","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-11157-3_38","article-title":"Abstract Computability on Algebraic Structures","volume":"vol. 122","author":"Ershov","year":"1981","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB9","series-title":"Logic Colloquium","first-page":"361","article-title":"Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory","author":"Friedman","year":"1971"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0002-9947-1992-1055807-7","article-title":"Algorithmic procedures","volume":"332","author":"Friedman","year":"1992","journal-title":"Trans. AMS"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/malq.19980440102","article-title":"Computability of string functions over algebraic structures","volume":"44","author":"Hemmerling","year":"1998","journal-title":"Math. Log. Quart."},{"key":"10.1016\/S0304-3975(98)00289-8_BIB12","series-title":"Proc. 6th Canadian Conf. on Computational Geometry","first-page":"237","article-title":"Levels of degeneracy and exact lower bounds for geometric algorithms","author":"Hertling","year":"1994"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB13","first-page":"35","article-title":"Das Unendliche in Philosophie, Theologie und Mathematik","author":"Heuser","year":"1997","journal-title":"DMV-Mitteilungen 3\/97"},{"year":"1978","series-title":"Recursion-Theoretic Hierarchies","author":"Hinman","key":"10.1016\/S0304-3975(98)00289-8_BIB14"},{"year":"1997","series-title":"Analytic machines","author":"Hotz","key":"10.1016\/S0304-3975(98)00289-8_BIB15"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB16","series-title":"Electron. Colloq. Comput. Complexity","article-title":"Analytic machines","author":"Hotz","year":"1995"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB17","first-page":"82","article-title":"The logical schemes of algorithms","volume":"1","author":"Janov","year":"1960","journal-title":"Problems Cybernet"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(83)90013-0","article-title":"Definability by programs in first-order structures","volume":"25","author":"Kfoury","year":"1983","journal-title":"Theoret. Comput. Sci."},{"year":"1952","series-title":"Introduction to Metamathematics","author":"Kleene","key":"10.1016\/S0304-3975(98)00289-8_BIB19"},{"year":"1991","series-title":"Complexity Theory of Real Functions","author":"Ko","key":"10.1016\/S0304-3975(98)00289-8_BIB20"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB21","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\/S0304-3975(98)00289-8_BIB22","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BFb0009642","article-title":"Complexity Theory on Real Numbers and Functions","volume":"vol. 145","author":"Kreitz","year":"1983","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB23","first-page":"220","article-title":"On formalised computer programs","volume":"4","author":"Luckham","year":"1970","journal-title":"JCSS"},{"year":"1997","series-title":"Numerical RAM: a realistic machine model for scientific computing","author":"der Heide","key":"10.1016\/S0304-3975(98)00289-8_BIB24"},{"year":"1980","series-title":"Descriptive Set Theory","author":"Moschovakis","key":"10.1016\/S0304-3975(98)00289-8_BIB25"},{"year":"1989","series-title":"Classical Recursion Theory","author":"Odifreddi","key":"10.1016\/S0304-3975(98)00289-8_BIB26"},{"year":"1989","series-title":"Computability in Analysis and Physics","author":"Pour-El","key":"10.1016\/S0304-3975(98)00289-8_BIB27"},{"year":"1985","series-title":"Computational Geometry","author":"Preparata","key":"10.1016\/S0304-3975(98)00289-8_BIB28"},{"year":"1967","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","key":"10.1016\/S0304-3975(98)00289-8_BIB29"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB30","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/malq.19760220148","article-title":"On the definition of computable function of a real variable","volume":"Bd. 22","author":"Shepherdson","year":"1976","journal-title":"Zeitschr. f. math. Logik und Grundlagen d. Math."},{"key":"10.1016\/S0304-3975(98)00289-8_BIB31","series-title":"Harvey Friedman's Research on the Foundations of Mathematics","first-page":"285","article-title":"Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory","author":"Shepherdson","year":"1985"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB32","series-title":"Harvey Friedman's Research on the Foundations of Mathematics","first-page":"309","article-title":"Computational complexity of real functions","author":"Shepherdson","year":"1985"},{"year":"1951","series-title":"A Decision Method for Elementary Algebra and Geometry","author":"Tarski","key":"10.1016\/S0304-3975(98)00289-8_BIB33"},{"year":"1988","series-title":"Program Correctness Over Abstract Data Types, with Error-State Semantics","author":"Tucker","key":"10.1016\/S0304-3975(98)00289-8_BIB34"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB35","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(98)00297-7","article-title":"Computation by \u2018while\u2019 programs on topological partial algebras","author":"Tucker","year":"1998"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB36","article-title":"Computable functions and semicomputable sets on many-sorted algebras","volume":"vol. 5","author":"Tucker","year":"1998"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB37_1","first-page":"230","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"vol. 42","author":"Turing","year":"1936"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB37_2","first-page":"544","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"vol. 43","author":"Turing","year":"1937"},{"year":"1987","series-title":"Computability","author":"Weihrauch","key":"10.1016\/S0304-3975(98)00289-8_BIB38"},{"article-title":"A simple introduction to computable analysis","year":"1995","author":"Weihrauch","key":"10.1016\/S0304-3975(98)00289-8_BIB39"},{"key":"10.1016\/S0304-3975(98)00289-8_BIB40","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0304-3975(97)00008-X","article-title":"Recursively enumerable subsets of Rq in two computing models \u2014 Blum-Shub-Smale machine and Turing machine","volume":"197","author":"Zhong","year":"1998","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002898?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002898?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:27:29Z","timestamp":1556508449000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0304397598002898"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00289-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}