A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis
A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis
复制标题
经典分析中证明的博弈论计算解释
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Thomas Powell
中科院分区：
文献类型：
--
作者：
Paulo Oliva;Thomas Powell
埃斯卡多和第一作者已经证明，在分析中，证明的函数解释可以由选择函数的乘积给出，选择函数是一种递归模式，在序列博弈的最优策略计算方面具有直观的解读。我们通过解释一些著名的数学定理并证明乘积给了这些定理一种自然的计算解释，从而证明了这一结果具有真正的实用价值，这一解释可以用博弈论的术语清楚地理解。
It has been shown by Escardo and the first author that a functional interpretation of proofs in analysis can be given by the product of selection functions, a mode of recursion that has an intuitive reading in terms of the computation of optimal strategies in sequential games. We argue that this result has genuine practical value by interpreting some well-known theorems of mathematics and demonstrating that the product gives these theorems a natural computational interpretation that can be clearly understood in game theoretic terms.