We study the hole probability of Gaussian entire functions. More specifically, we work with entire functions given by a Taylor series with i.i.d complex Gaussian random variables and arbitrary non-random coefficients.

I will give an introduction to the problem of parallel repetition of two-prover games and its applications and related results in theoretical computer science (the PCP theorem, hardness of approximation), mathematics (the geometry of foams, tiling the space R^n) and, if time allows, physics (Bell inequalities, the EPR paradox).