Pith. sign in

REVIEW 2 cited by

On the topological aspects of the theory of represented spaces

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1204.3763 v3 pith:UKY7OBPF submitted 2012-04-17 math.LO

classification math.LO
keywords spacesrepresentedtheoryderivedaspectscomputabilitycomputablemappings
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented spaces is well-known to exhibit a strong topological flavour. We present an abstract and very succinct introduction to the field; drawing heavily on prior work by Escard\'o, Schr\"oder, and others. Central aspects of the theory are function spaces and various spaces of subsets derived from other represented spaces, and -- closely linked to these -- properties of represented spaces such as compactness, overtness and separation principles. Both the derived spaces and the properties are introduced by demanding the computability of certain mappings, and it is demonstrated that typically various interesting mappings induce the same property.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 73 citations worldwide. Full citation record

  1. Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space

    cs.LO 2025-06 accept novelty 7.0 of 10

    A single, simple search algorithm decides the escape problem for all robust instances, and is provably complete for the weakest representation of continuous functions.

  2. Algorithmically Presented Numbers and Canonical Representations in Cryptographic Protocols

    cs.CR 2026-07 conditional novelty 3.5 of 10

    There is no computable extensional map that turns arbitrary approximation programs for the same computable real into one unique finite code, so protocols must fix a canonical representation up front.

Pith tools