The paper gives an overview of some proofs of Gödel's incompleteness theorem which are based on specific examples of game theory, graph theory and the theory of algorithms. It is shown that the problems of terminating games and programs fall outside the framework of Peano's arithmetic and first-order logic.