In the last decades, several objects such as grammars, economical agents, laws of physics... have been defined as algorithms. In particular, after Brouwer, Heyting, and Kolomogorov, mathematical proofs have been defined as algorithms. In this paper, we show that mathematical theories can be also be defined as algorithms and that this definition has some advantages over the usual definition of theories as sets of axioms.

翻译：在过去几十年中，诸如语法、经济主体、物理定律等若干对象已被定义为算法。特别是，继布劳威尔、海廷和科尔莫戈罗夫之后，数学证明已被定义为算法。本文表明，数学理论同样可以定义为算法，并且这一定义相较于将理论视为公理集的常规定义具有若干优势。