Pages that link to "Item:Q1923085"

The following pages link to Real number computability and domain theory (Q1923085):

Displaying 36 items.

• On the computing power of fuzzy Turing machines (Q835106) (← links)
• Computability on reals, infinite limits and differential equations (Q990444) (← links)
• A constructive theory of continuous domains suitable for implementation (Q1023289) (← links)
• A domain-theoretic approach to computability on the real line (Q1274807) (← links)
• Real numbers and computers (Q1279561) (← links)
• A new approach to computability over the reals (Q1284389) (← links)
• Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets (Q1292396) (← links)
• Properly injective spaces and function spaces (Q1295213) (← links)
• Hierarchies of total functionals over the reals (Q1434355) (← links)
• Domain representations of topological spaces (Q1583255) (← links)
• Contractivity of linear fractional transformations (Q1603893) (← links)
• Real number computation through Gray code embedding. (Q1607300) (← links)
• A category of compositional domain-models for separable Stone spaces. (Q1853606) (← links)
• Integration in Real PCF (Q1854356) (← links)
• Computability on dl-domains (Q1908351) (← links)
• On logarithmic-space computable real numbers (Q1935807) (← links)
• An abstract data type for real numbers (Q1960529) (← links)
• Spectrum of the field of computable real numbers (Q2401539) (← links)
• On the computational content of the Lawson topology (Q2500493) (← links)
• Can partial indexings be totalized? (Q2758051) (← links)
• On the Cantor-Bendixson rank of a set that is searchable in Gödel's \(T\) (Q2799751) (← links)
• Reducibility of domain representations and Cantor–Weihrauch domain representations (Q3545272) (← links)
• (Q4234078) (← links)
• Domains for Computation in Mathematics, Physics and Exact Real Arithmetic (Q4382500) (← links)
• An abstract data type for real numbers (Q4571945) (← links)
• In Domain Realizability, not all Functionals on C[–1, 1] are Continuous (Q4787855) (← links)
• Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals (Q4928437) (← links)
• Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages (Q5275234) (← links)
• A Functional Algorithm for Exact Real Integration with Invariant Measures (Q5415647) (← links)
• Computing with Functionals—Computability Theory or Computer Science? (Q5479568) (← links)
• (Q5856423) (← links)
• Logical Approaches to Computational Barriers (Q5898855) (← links)
• Decidable fan theorem and uniform continuity theorem with continuous moduli (Q6047675) (← links)
• Recursive solution of initial value problems with temporal discretization (Q6069850) (← links)
• A domain-theoretic framework for robustness analysis of neural networks (Q6149907) (← links)
• Countability constraints in order-theoretic approaches to computability (Q6635153) (← links)