It is one of the most challenging issues in applied mathematics to approximately solve high-dimensional partial differential equations (PDEs) and most of the numerical approximation methods for PDEs in the scientific literature suffer from the so-called curse of dimensionality in the sense that the number of computational operations employed in the corresponding approximation scheme to obtain an approximation precision $ε>0$ grows exponentially in the PDE dimension and/or the reciprocal of $ε.$ Recently, certain deep learning based methods for PDEs have been proposed and various numerical simulations for such methods suggest that deep artificial neural network (ANN) approximations might have the capacity to indeed overcome the curse of dimensionality in the sense that the number of real parameters used to describe the approximating deep ANNs grows at most polynomially in both the PDE dimension $d ∈ \mathbb{N}$ and the reciprocal of the prescribed approximation accuracy $ε > 0.$ There are now also a few rigorous mathematical results in the scientific literature which substantiate this conjecture by proving that deep ANNs overcome the curse of dimensionality in approximating solutions of PDEs. Each of these results establishes that deep ANNs overcome the curse of dimensionality in approximating suitable PDE solutions at a fixed time point $T > 0$ and on a compact cube $[a, b]^d$ in space but none of these results provides an answer to the question whether the entire PDE solution on $[0, T ] × [a, b]^d$ can be approximated by deep ANNs without the curse of dimensionality. It is precisely the subject of this article to overcome this issue. More specifically, the main result of this work in particular proves for every $a ∈\mathbb{R},$ $b ∈ (a,∞)$ that solutions of certain Kolmogorov PDEs can be approximated by deep ANNs on the space-time region $[0, T ] × [a, b]^d$ without the curse of dimensionality.