We investigate the descriptive complexity of connectedness (pathwise connectedness, local connectedness) of Polish spaces, and prove that even in the frame of finite dimensional euclidean spaces this complexity can be as high as possible, and much beyond the first projective classes Σ 1 1 and Π 1 1. In particular we prove that several of these notions are Π 1 2-complete.