Real number computability and domain theory

DOI10.1006/INCO.1996.0046zbMATH Open0856.68080OpenAlexW2084041069MaRDI QIDQ1923085FDOQ1923085

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

domain theorycomputability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (34)

• Title not available (Why is that?)
• Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
• Contractivity of linear fractional transformations
• Title not available (Why is that?)
• On the Cantor-Bendixson rank of a set that is searchable in Gödel's \(T\)
• A domain-theoretic framework for robustness analysis of neural networks
• An abstract data type for real numbers
• Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals
• Logical Approaches to Computational Barriers
• Integration in Real PCF
• Real numbers and computers
• Computability on reals, infinite limits and differential equations
• Decidable fan theorem and uniform continuity theorem with continuous moduli
• A new approach to computability over the reals
• Hierarchies of total functionals over the reals
• Domain representations of topological spaces
• Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets
• Computing with Functionals—Computability Theory or Computer Science?
• Real number computation through Gray code embedding.
• Properly injective spaces and function spaces
• A category of compositional domain-models for separable Stone spaces.
• Computability on dl-domains
• An abstract data type for real numbers
• Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
• Reducibility of domain representations and Cantor–Weihrauch domain representations
• On the computing power of fuzzy Turing machines
• Recursive solution of initial value problems with temporal discretization
• Countability constraints in order-theoretic approaches to computability
• Title not available (Why is that?)
• Can partial indexings be totalized?
• Spectrum of the field of computable real numbers
• A domain-theoretic approach to computability on the real line
• A Functional Algorithm for Exact Real Integration with Invariant Measures
• On logarithmic-space computable real numbers

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Computability and totality in domains 👍 👎
• Low functions of reals 👍 👎
• A domain-theoretic approach to computability on the real line 👍 👎
• On approximate and algebraic computability over the real numbers 👍 👎
• Spectrum of the field of computable real numbers 👍 👎
• Logical Approaches to Computational Barriers 👍 👎
• Computability on reals, infinite limits and differential equations 👍 👎
• Computability of Real Numbers 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923085)