Computation by `While' programs on topological partial algebras
type: Item
instance of: scholarly article
title: Computation by `While' programs on topological partial algebras
zbMATH Open document ID: 0916.68046
DOI: 10.1016/S0304-3975(98)00297-7
author: John V. Tucker
author: Jeffery Zucker
published in: Theoretical Computer Science
publication date: 1999-06-21T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1306141
zbMATH Keywords: abstract compatibility
zbMATH Keywords: topological algebra
zbMATH Keywords: partial algebra
zbMATH Keywords: real computation
MaRDI profile type: Publication
cites work: Domain representability of metric spaces
cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Recursive characterization of computable real-valued functions and relations
cites work: Order-free Recursion on the Real Numbers
cites work: Q5737081
cites work: Q4127981
cites work: Domain theory and integration
cites work: Dynamical systems, measures, and fractals via domain theory
cites work: A domain-theoretic approach to computability on the real line
cites work: Algorithmic approximations
cites work: Algorithmic properties of structures
cites work: Q5569439
cites work: Q5538913
cites work: Fundamentals of generalized recursion theory
cites work: Q5625129
cites work: Computable functionals
cites work: On the definitions of computable real continuous functions
cites work: Q4002474
cites work: Theory of representations
cites work: Q3226754
cites work: Q5601829
cites work: Recursive metric spaces
cites work: Abstract First Order Computability. I
cites work: Q5654032
cites work: On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
cites work: Q3994907
cites work: Recursive Real Numbers
cites work: On the Definition of Computable Function of a Real Variable
cites work: Q4023580
cites work: Complete local rings as domains
cites work: Algebraic and fixed point equations over inverse limits of algebras
cites work: Q4857386
cites work: Concrete models of computation for topological algebras
cites work: Q5586318
cites work: Q3050415
cites work: Q4039815
cites work: Deterministic and nondeterministic computation, and horn programs, on abstract data types
cites work: Examples of semicomputable sets of real and complex numbers
cites work: Theory of computation over stream algebras, and its applications
cites work: Q3138835
cites work: Q4842541
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
cites work: Q3751553
cites work: Embedding metric spaces into CPO's
Wikidata QID: Q127087500
full work available at URL: s0304-3975(98)00297-7
OpenAlex ID: W2058108130
Recommended article: Concrete models of computation for topological algebras
Recommended article: An application of computer algebra to algebraic topology
Recommended article: A topological view on algebraic computation models
Recommended article: Programs in partial algebras
Recommended article: The computability problem in algebraic topology
Recommended article: Q4500930
Recommended article: Q5457390
Recommended article: Q3203724
Recommended article: Notions of semicomputability in topological algebras over the reals
Recommended article: Q4282575
description: scientific article; zbMATH DE number 1306141