Computation by `While' programs on topological partial algebras
From MaRDI portal
(Redirected from Computation by `While' programs on topological partial algebras)
Recommendations
- Concrete models of computation for topological algebras
- An application of computer algebra to algebraic topology
- A topological view on algebraic computation models
- Programs in partial algebras
- The computability problem in algebraic topology
- scientific article; zbMATH DE number 1498598
- scientific article; zbMATH DE number 5263151
- scientific article; zbMATH DE number 4180345
- Notions of semicomputability in topological algebras over the reals
- scientific article; zbMATH DE number 517047
Cites work
- A domain-theoretic approach to computability on the real line
- Abstract First Order Computability. I
- Algebraic and fixed point equations over inverse limits of algebras
- Algorithmic approximations
- Algorithmic properties of structures
- Complete local rings as domains
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Computable functionals
- Concrete models of computation for topological algebras
- Deterministic and nondeterministic computation, and horn programs, on abstract data types
- Domain representability of metric spaces
- Domain theory and integration
- Dynamical systems, measures, and fractals via domain theory
- Embedding metric spaces into CPO's
- Examples of semicomputable sets of real and complex numbers
- Fundamentals of generalized recursion theory
- scientific article; zbMATH DE number 3645075 (Why is no real title available?)
- scientific article; zbMATH DE number 432708 (Why is no real title available?)
- scientific article; zbMATH DE number 3112803 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 107999 (Why is no real title available?)
- scientific article; zbMATH DE number 192929 (Why is no real title available?)
- scientific article; zbMATH DE number 3555422 (Why is no real title available?)
- scientific article; zbMATH DE number 785052 (Why is no real title available?)
- scientific article; zbMATH DE number 821282 (Why is no real title available?)
- scientific article; zbMATH DE number 3252196 (Why is no real title available?)
- scientific article; zbMATH DE number 3286020 (Why is no real title available?)
- scientific article; zbMATH DE number 3305014 (Why is no real title available?)
- scientific article; zbMATH DE number 3322506 (Why is no real title available?)
- scientific article; zbMATH DE number 3349780 (Why is no real title available?)
- scientific article; zbMATH DE number 3383999 (Why is no real title available?)
- scientific article; zbMATH DE number 3200656 (Why is no real title available?)
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- On the Definition of Computable Function of a Real Variable
- On the definitions of computable real continuous functions
- Order-free Recursion on the Real Numbers
- Recursive characterization of computable real-valued functions and relations
- Recursive metric spaces
- Recursive Real Numbers
- Theory of computation over stream algebras, and its applications
- Theory of representations
Cited in
(15)- Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
- On approximate and algebraic computability over the real numbers
- Concrete models of computation for topological algebras
- Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
- The data type of spatial objects
- Models of computation for partial functions on the reals
- Generalizing Computability Theory to Abstract Algebras
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- Characterizations of semicomputable sets of real numbers
- scientific article; zbMATH DE number 1870419 (Why is no real title available?)
- Notions of semicomputability in topological algebras over the reals
- Semantics, specification logic, and Hoare logic of exact real computation
- Universality and semicomputability for nondeterministic programming languages over abstract algebras
- Primitive recursive selection functions for existential assertions over abstract algebras
This page was built for publication: Computation by `While' programs on topological partial algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292414)
