Weihrauch Complexity in Computable Analysis
Logic
2021-09-28 v4 Logic in Computer Science
Abstract
We provide a self-contained introduction into Weihrauch complexity and its applications to computable analysis. This includes a survey on some classification results and a discussion of the relation to other approaches.
Cite
@article{arxiv.1707.03202,
title = {Weihrauch Complexity in Computable Analysis},
author = {Vasco Brattka and Guido Gherardi and Arno Pauly},
journal= {arXiv preprint arXiv:1707.03202},
year = {2021}
}
Comments
50 pages plus 11 pages appendix