A domain-theoretic approach to computability on the real line

DOI10.1016/S0304-3975(98)00097-8zbMath0912.68031MaRDI QIDQ1274807

Philipp Sünderhauf, Abbas Edalat

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

computational modelcomputable real numberinterval mathematicseffective domaincomputable function

Mathematics Subject Classification ID

Related Items

Domain theoretic second-order Euler's method for solving initial value problems, The best interval representations of t-norms and automorphisms, Unnamed Item, Recursive solution of initial value problems with temporal discretization, A domain-theoretic framework for robustness analysis of neural networks, Effectiveness in RPL, with applications to continuous logic, Unnamed Item, Coherence Spaces and Uniform Continuity, Computing with continuous objects: a uniform co-inductive approach, Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract], Towards Computability over Effectively Enumerable Topological Spaces, A differential operator and weak topology for Lipschitz maps, A characterization of computable analysis on unbounded domains using differential equations, Computable analysis with applications to dynamic systems, A computable approach to measure and integration theory, On the Kolmogorov Complexity of Continuous Real Functions, The Dedekind reals in abstract Stone duality, Induction and recursion on the partial real line with applications to Real PCF, Real functions incrementally computable by finite automata, Computable Banach spaces via domain theory, Computation by `While' programs on topological partial algebras, A Domain-Theoretic Approach to Integration in Hausdorff Spaces, Foundation of a computable solid modelling., Real functions computable by finite automata using affine representations., Real number computation through Gray code embedding., Interpolation functor and computability.

Cites Work

• Domain theory and integration
• Domain representability of metric spaces
• Theory of representations
• Effectively given domains
• Embedding metric spaces into CPO's
• Computable Banach spaces via domain theory
• PCF extended with real numbers
• Computable functionals of finite types
• Dynamical systems, measures, and fractals via domain theory
• Power domains and iterated function systems
• Real number computability and domain theory
• Computable functionals
• On the definitions of computable real continuous functions
• Complete local rings as domains
• When Scott is weak on the top
• Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Algorithmic operators in constructive metric spaces
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Recursive Real Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item