论文标题
Weihrauch复杂性和Hagen可计算分析学院
Weihrauch Complexity and the Hagen School of Computable Analysis
论文作者
论文摘要
Weihrauch复杂性现在是数学逻辑中建立且积极的部分。它可以看作是一种计算性理论方法，可以对数学问题的统一计算内容进行分类。该理论已成为反向数学领域中更多证明理论和更多可计算性理论研究之间的重要接口。在这里，我们介绍了三十多年前的哈根计算分析学院对Weihrauch复杂性的早期发展的历史记载，我们指出这如何影响该主题的最新发展，了解到这一点。
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.
