Real number computability and domain theory

DOI10.1006/INCO.1996.0046zbMath0856.68080OpenAlexW2084041069MaRDI QIDQ1923085

Pietro Di Gianantonio

Publication date: 3 February 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.0046

zbMATH Keywords

computabilitydomain theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (23)

On the computing power of fuzzy Turing machines ⋮ Unnamed Item ⋮ Decidable fan theorem and uniform continuity theorem with continuous moduli ⋮ Recursive solution of initial value problems with temporal discretization ⋮ A domain-theoretic framework for robustness analysis of neural networks ⋮ An abstract data type for real numbers ⋮ Reducibility of domain representations and Cantor–Weihrauch domain representations ⋮ Hierarchies of total functionals over the reals ⋮ Domains for Computation in Mathematics, Physics and Exact Real Arithmetic ⋮ A Functional Algorithm for Exact Real Integration with Invariant Measures ⋮ Can partial indexings be totalized? ⋮ On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T ⋮ Computing with Functionals—Computability Theory or Computer Science? ⋮ A domain-theoretic approach to computability on the real line ⋮ Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets ⋮ Properly injective spaces and function spaces ⋮ Domain representations of topological spaces ⋮ An abstract data type for real numbers ⋮ A category of compositional domain-models for separable Stone spaces. ⋮ Integration in Real PCF ⋮ Contractivity of linear fractional transformations ⋮ Real number computation through Gray code embedding. ⋮ Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages

This page was built for publication: Real number computability and domain theory