Models of computation for partial functions on the reals
From MaRDI portal
Publication:2258841
DOI10.1016/j.jlamp.2014.11.001zbMath1320.68079MaRDI QIDQ2258841
Publication date: 27 February 2015
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2014.11.001
generalized computability; computability on the reals; computability on topological algebra; Grzegorczyk-Lacombe computability
03D78: Computation over the reals, computable analysis
03D75: Abstract and axiomatic computability and recursion theory
Related Items
Cites Work
- Domain theory and integration
- Concrete models of computation for topological algebras
- Computation by `While' programs on topological partial algebras
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
- Dynamical systems, measures, and fractals via domain theory
- Stability of representations of effective partial algebras
- Computable functionals
- On the definitions of computable real continuous functions
- A Real Number Structure that is Effectively Categorical
- Abstract versus concrete computation on metric partial algebras
- Some undecidable problems involving elementary functions of a real variable
- Recursive metric spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item