On the topological aspects of the theory of represented spaces

DOI10.3233/COM-150049zbMath1401.03087arXiv1204.3763OpenAlexW1517951509MaRDI QIDQ5740207

Arno Pauly

Publication date: 25 July 2016

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.3763

zbMATH Keywords

realizabilityadmissible representationcomputable analysissynthetic topology

Mathematics Subject Classification ID

Compactness (54D30) Lower separation axioms ((T_0)--(T_3), etc.) (54D10) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)

Related Items (38)

The fixed-point property for represented spaces ⋮ Comparing representations for function spaces in computable analysis ⋮ Effective aspects of Hausdorff and Fourier dimension ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ A topological view on algebraic computation models ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ Unnamed Item ⋮ Algebraic properties of the first-order part of a problem ⋮ Strong computable type ⋮ On computability and disintegration ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ Computable Stone spaces ⋮ Notes on overt choice ⋮ De groot duality for represented spaces ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ The Vitali Covering Theorem in the Weihrauch Lattice ⋮ Many-one reductions and the category of multivalued functions ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ On the algebraic structure of Weihrauch degrees ⋮ Towards computable analysis on the generalised real line ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computable analysis with applications to dynamic systems ⋮ On the computability of the set of automorphisms of the unit square ⋮ Representations and evaluation strategies for feasibly approximable functions ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ Unnamed Item ⋮ SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE ⋮ On envelopes and backward approximations ⋮ Point Degree Spectra of Represented Spaces ⋮ Some notes on spaces of ideals and computable topology ⋮ Computability of Subsets of Metric Spaces ⋮ Admissibly Represented Spaces and Qcb-Spaces ⋮ Weihrauch Complexity in Computable Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closed choice and a uniform low basis theorem
• Dynamics and abstract computability: computing invariant measures
• Metric spaces in synthetic topology
• Admissible representations of effective cpo's
• Type 2 recursion theory
• Theory of representations
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computability on the probability measures on the Borel sets of the unit interval
• Recursive characterization of computable real-valued functions and relations
• Computability on subsets of metric spaces.
• Extended admissibility.
• Quasi-Polish spaces
• Feasibly continuous type-two functionals
• Real hypercomputation and continuity
• A lambda calculus for real analysis
• Effective Borel measurability and reducibility of functions
• Computable operators on regular sets
• Spaces allowing Type‐2 Complexity Theory revisited
• Co-c.e. spheres and cells in computable metric spaces
• A Hausdorff Topology for the Closed Subsets of a Locally Compact Non-Hausdorff Space
• Borel Complexity of Topological Operations on Computable Metric Spaces
• Plottable Real Number Functions and the Computable Graph Theorem
• A Relationship between Equilogical Spaces and Type Two Effectivity
• Effectivity in Spaces with Admissible Multirepresentations
• Computational complexity on computable metric spaces
• Effectiveness for Embedded Spheres and Balls
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
• Revising Type-2 Computation and Degrees of Discontinuity
• Admissible representations for probability measures

This page was built for publication: On the topological aspects of the theory of represented spaces