arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1602.07509math.LOcs.LO
收藏

可计算性与分析:历史方法

Computability and Analysis, a Historical Approach

Vasco Brattka

摘要:

自20世纪初以来,可计算性理论的历史和分析的历史令人惊讶地交织在一起。其一,埃米尔·博雷尔在他的测度论导论中讨论了他对可计算实数函数的想法。另一方面,艾伦·图灵在介绍他现在著名的机器模型时,脑子里就有可计算的实数。在这里,我们想集中在可计算性和分析的一个特定方面,即分析定理的可计算性。这是一个主题,已经出现在早期工作的图灵,斯派克和其他先驱的可计算分析,并最终导致我们最近的项目分类的计算内容的定理在Weihrauch格。

英文摘要:

The history of computability theory and and the history of analysis are surprisingly intertwined since the beginning of the twentieth century. For one, Émil Borel discussed his ideas on computable real number functions in his introduction to measure theory. On the other hand, Alan Turing had computable real numbers in mind when he introduced his now famous machine model. Here we want to focus on a particular aspect of computability and analysis, namely on computability properties of theorems from analysis. This is a topic that emerged already in early work of Turing, Specker and other pioneers of computable analysis and eventually leads us to the very recent project of classifying the computational content of theorems in the Weihrauch lattice.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑