On the computability of Nash equilibria

We present some algorithmic unsolvability and incompleteness results in game theory and discuss their significance. The main theorem presents a class of n-person games, where each player's strategy set is the real line and payoffs are continuous functions, for which there could not possibly exist an algorithm to compute either a Nash equilibrium or an epsilon-equilibrium. Conditions sufficient to ensure solvability are also discussed.