REVIEW 1 cited by
Weihrauch Complexity and the Hagen School of 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
read the original abstract
Weihrauch complexity is now an established and active part of mathematical logic. It can be seen as a computability-theoretic approach to classifying the uniform computational content of mathematical problems. This theory has become an important interface between more proof-theoretic and more computability-theoretic studies in the realm of reverse mathematics. Here we present a historical account of the early developments of Weihrauch complexity by the Hagen school of computable analysis that started more than thirty years ago, and we indicate how this has influenced, informed, and anticipated more recent developments of the subject.
Forward citations
Cited by 1 Pith paper
-
Endpoint Koopman Spectral Computation: $L^1$ Residual Bounds, $L^\infty$ Instability, and Point-Spectral SCI Calibration Families
For L∞ Koopman operators on Cantor systems, approximate point spectra are not computable by any finite tower of algorithms; L1 upper bounds match the reflexive regime.
Discussion (0). Continue with ORCID to comment.