# Computational folk theorem

Last edited: 2025-12-05

# Statement

Lemma

For any 2-player discounted reward repeated game it is possible to build a Pavlov-like machine that is Subgame perfect and achieves Nash equilibrium in polynomial time. This is done in one of three ways

# Proof