Pith. sign in

REVIEW 1 cited by

Comparing representations for function spaces in computable analysis

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 1512.03024 v2 pith:F643XUYI submitted 2015-12-09 cs.LO

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

This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared to more natural representations for these spaces. The formal framework for the comparisons is provided by Weihrauch reducibility. The centrepiece of the paper considers several representations of the analytic functions on the unit disk and their mutual translations. All translations that are not already computable are shown to be Weihrauch equivalent to closed choice on the natural numbers. Subsequently some similar considerations are carried out for representations of polynomials. In this case in addition to closed choice the Weihrauch degree LPO* shows up as the difficulty of finding the degree or the zeros. As a final example, the smooth functions are contrasted with functions with bounded support and Schwartz functions. Here closed choice on the natural numbers and the lim degree appear.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. 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