{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:24:48Z","timestamp":1761596688906},"reference-count":54,"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)00297-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:38:06Z","timestamp":1027604286000},"page":"379-420","source":"Crossref","is-referenced-by-count":25,"title":["Computation by \u2018While\u2019 programs on topological partial algebras"],"prefix":"10.1016","volume":"219","author":[{"given":"J.V.","family":"Tucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.I.","family":"Zucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00297-7_BIB1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0168-0072(96)00017-6","article-title":"Domain representability of metric spaces","volume":"83","author":"Blanck","year":"1997","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"10.1016\/S0304-3975(98)00297-7_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/S0218127496001818","article-title":"Complexity and real computation: a manifesto","volume":"6","author":"Blum","year":"1996","journal-title":"Internat. J. Bifurcation Chaos"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB3","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. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(95)00249-9","article-title":"Recursive characterisation of computable real-valued functions and relations","volume":"162","author":"Brattka","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/malq.19970430206","article-title":"Order-free recursion on the real numbers","volume":"43","author":"Brattka","year":"1997","journal-title":"Math. Logic Quart."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB6","first-page":"49","article-title":"Algebraic operators in constructive complete separable metric spaces","volume":"128","author":"Ceitin","year":"1959","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB7","doi-asserted-by":"crossref","unstructured":"A.K. Chandra, Z. Manna, Program schemes with equality, Proc. 4th Ann. ACM Symp. on the Theory of Computing, Denver, CO, Association for Computing Machinery, pp. 52\u201364.","DOI":"10.1145\/800152.804896"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(95)00050-7","article-title":"Domain theory and integration","volume":"151","author":"Edalat","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB9","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1006\/inco.1995.1096","article-title":"Dynamical systems, measures, and fractals via domain theory","volume":"120","author":"Edalat","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0304-3975(98)00097-8","article-title":"A domain-theoretic approach to computability on the real line","volume":"210","author":"Edalat","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0022-0000(71)80008-9","article-title":"Algorithmic approximations","volume":"5","author":"Engeler","year":"1971","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01705528","article-title":"Algebraic properties of structures","volume":"1","author":"Engeler","year":"1967","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB13","series-title":"Syntax and Semantics of Infinitary Languages","first-page":"64","article-title":"Remarks on the theory of geometrical constructions","volume":"vol. 72","author":"Engeler","year":"1968"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB14","series-title":"Formal Languages: Automata and Structures","author":"Engeler","year":"1968"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB15","series-title":"Fundamentals of Generalized Recursion Theory","author":"Fitting","year":"1981"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB16","series-title":"Logic Colloquium '69","first-page":"361","article-title":"Algebraic procedures, generalized Turing algorithms, and elementary recursion theory","author":"Friedman","year":"1971"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB17","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4064\/fm-42-1-168-202","article-title":"Computable functions","volume":"42","author":"Grzegorczyk","year":"1955","journal-title":"Fund. Math."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","article-title":"On the definitions of computable real continuous functions","volume":"44","author":"Grzegorczyk","year":"1957","journal-title":"Fund. Math."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB19","series-title":"Complexity Theory of Real Functions","author":"Ko","year":"1991"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(85)90208-7","article-title":"Theory of representations","volume":"38","author":"Kreitz","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB21_1","first-page":"2470","article-title":"Extension de la notion de fonction r\u00e9cursive aux fonctions d'une ou plusieurs variables r\u00e9elles, I","volume":"240","author":"Lacombe","year":"1955","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB21_2","first-page":"13","article-title":"Extension de la notion de fonction r\u00e9cursive aux fonctions d'une ou plusieurs variables r\u00e9elles, II","volume":"241","author":"Lacombe","year":"1955","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB21_3","first-page":"151","article-title":"Extension de la notion de fonction r\u00e9cursive aux fonctions d'une ou plusieurs variables r\u00e9elles, III","volume":"241","author":"Lacombe","year":"1955","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB22","series-title":"Computer Programming and Formal Systems","first-page":"33","article-title":"A basis for a mathematical theory of computation","author":"McCarthy","year":"1963"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.4064\/fm-55-3-215-238","article-title":"Recursive metric spaces","volume":"55","author":"Moschovakis","year":"1964","journal-title":"Fund. Math."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB24","first-page":"427","article-title":"Abstract first order computability I","volume":"138","author":"Moschovakis","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB25","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1090\/S0002-9947-69-99947-4","article-title":"Abstract first order computability II","volume":"138","author":"Moschovakis","year":"1996","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB26","series-title":"Logic Colloquium '69","first-page":"199","article-title":"Axioms for computation theories \u2014 first draft","author":"Moschovakis","year":"1971"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/malq.19750210102","article-title":"On a simple definition of computable function of a real variable with applications to functions of a complex variable","volume":"21","author":"Pour-El","year":"1975","journal-title":"Z. Math. Logik Grundlagen Mathematik"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB28","series-title":"Computability in Analysis and Physics","author":"Pour-El","year":"1989"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB29","first-page":"784","article-title":"Recursive real numbers","volume":"5","author":"Rice","year":"1954"},{"key":"10.1016\/S0304-3975(98)00297-7_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":"22","author":"Shepherdson","year":"1976","journal-title":"Z. Math. Logik Grundlagen Mathematik"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB31","series-title":"Harvey Friedman's Research on the Foundations of Mathematics","first-page":"285","article-title":"Algebraic procedures, generalized Turing algorithms, and elementary recursion theory","author":"Shepherdson","year":"1985"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB32","article-title":"An algebraic approach to syntax, semantics and computation","author":"Stephenson","year":"1996"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB33","series-title":"Mathematical Theory of Domains","author":"Stoltenberg-Hansen","year":"1994"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB34","article-title":"Complete local rings as domains","author":"Stoltenberg-Hansen","year":"1985"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB35","doi-asserted-by":"crossref","first-page":"603","DOI":"10.2307\/2274527","article-title":"Complete local rings as domains","volume":"53","author":"Stoltenberg-Hansen","year":"1988","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(06)80002-2","article-title":"Algebraic and fixed point equations over inverse limits of algebras","volume":"87","author":"Stoltenberg-Hansen","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB37","series-title":"Semantics: Foundations and Applications","first-page":"531","article-title":"Infinite systems of equations over inverse limits and infinite synchronous concurrent algorithms","volume":"vol. 666","author":"Stoltenberg-Hansen","year":"1993"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB38","first-page":"357","article-title":"Effective algebras","volume":"vol. 4","author":"Stoltenberg-Hansen","year":"1995"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB39","article-title":"Concrete models of computation for topological algebras","author":"Stoltenberg-Hansen","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB40","series-title":"Wissenschaftstheorische Unitersuchungen in algorithmischen Sprachen","author":"Thiele","year":"1966"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB41","series-title":"Recursion Theory, its Generalisations and Applications","first-page":"215","article-title":"Computing in algebraic systems","volume":"vol. 45","author":"Tucker","year":"1980"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB42","article-title":"Program Correctness over Abstract Data Types, with Error-State Semantics","volume":"vol. 6","author":"Tucker","year":"1988"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB43","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0743-1066(92)90020-4","article-title":"Deterministic and nondeterministic computation, and Horn programs, on abstract data types","volume":"13","author":"Tucker","year":"1992","journal-title":"J. Logic Programm."},{"key":"10.1016\/S0304-3975(98)00297-7_BIB44","series-title":"Constructivity in Computer Science: Summer Symposium","first-page":"179","article-title":"Examples of semicomutable sets of real and complex numbers","volume":"vol. 613","author":"Tucker","year":"1992"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB45","series-title":"Mathematical Foundations of Computer Science 1992: 17th Internat. Symp. Prague","first-page":"62","article-title":"Theory of computation over stream algebras, and its applications","volume":"vol. 629","author":"Tucker","year":"1992"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB46","series-title":"Proof Theory","first-page":"277","article-title":"Provable computable selection functions on abstract structures","author":"Tucker","year":"1993"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB47","series-title":"NATO Advanced Study Institute, International Summer School at Marktoberdorf","first-page":"341","article-title":"Computable functions on stream algebras","author":"Tucker","year":"1994"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB48","article-title":"Computable functions and semicomputable sets on many-sorted algebras","volume":"vol. 5","author":"Tucker","year":"1999"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB49_1","first-page":"230","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"42","author":"Turing","year":"1936"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB49_2","first-page":"544","volume":"43","author":"Turing","year":"1937","journal-title":"correction"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB50","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69965-8","article-title":"Computability","author":"Weihrauch","year":"1987"},{"key":"10.1016\/S0304-3975(98)00297-7_BIB51","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(81)90027-X","article-title":"Embedding metric spaces into cpo's","volume":"16","author":"Weihrauch","year":"1981","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002977?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002977?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T17:46:31Z","timestamp":1578505591000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002977"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":54,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0304397598002977"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00297-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}