This paper offers a new solution to the Surprise Test Paradox. The paradox arises thanks to an ingenious argument that seems to show that surprise tests are impossible. My solution to the paradox states that it relies on a questionable closure principle. This closure principle says that if one knows something and competently deduces something else, one knows the further thing. This principle has been endorsed by John Hawthorne and Timothy Williamson, among others, and I trace its motivation back to (...) work by Alvin Goldman. I provide counterexamples to the principle and explain the flaw in the reasoning of those who defend it. (shrink)

We represent the well-known surprise exam paradox in constructive and computable mathematics and offer solutions. One solution is based on Brouwer’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.

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...) is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (shrink)