In order to use the RK methods, you need to know the state of the system at future time-steps which can be expensive to compute (e.g., in physics simulations). As a simple example I'll use RK-2:

In order to evaluate K_2 I need to evaluate F at time step t + h. In a mechanics simulation you need to compute all the forces acting on an object to compute F -- therefore you need to know the state of the system at the current time step $t$ to evaluate K_1; and then you need to know the state at time step t + h to compute K_2. But how do you know this?
It seems to me that you have already written the answer to your own question. The three lines you wrote defines a Runge-Kutta method (I believe that in this particalar case, it is also called the Heun method). Knowing $X$ (which is short for $X(t)$), you can easily get $K_1$. Knowing $K_1$, you can easily get $K_2$. Knowing $K_1$ and $K_2$, you can get $X(t+h)$, and loop the procedure.
The cases where such a calculation is possible are called "explicit methds" : you "only" have to evaluate $F$ for different $(t,X)$ points. There exist some methods however where the $K_i$ are given as functions of all $K_j$s, and a direct computation is not possible anymore. You have to solve for all the $K_i$s at once, and this is why those method are called "implicit".
If you can put your hands on it, I wamli recommand the book Hairer, E., Lubich, C., & Wanner, G. (2005). Geometric numerical integration, 22(5), 1. doi:10.1080/10640266.2014.951249, which is the very best I have read about numerical methods for ordinary differential equations.
Hope this helps !