A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis

Details A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis

2012-04-24

arxiv.org/abs/1204.5244v1

Mathematics

Logic

Scientific paper

It has been shown that a functional interpretation of proofs in mathematical 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.

Affiliated with

Also associated with

No associations

Rating

A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-518787