摘要
We represent the well-known surprise exam paradox in constructive and computable mathematics and offer solutions. One solution is based on Brouwer%26apos;s continuity principle in constructive mathematics, and the other involves type 2 Turing computability in classical mathematics. We also discuss the backward induction paradox for extensive form games in constructive logic.
- 出版日期2012-12