Kolmogorov randomness for Pseudo random number generator I am working on pseudo random number generation for one of my projects. My goal is to prove that the output is almost Kolmogorov Random since Kolmogorov complexity is uncomputable.
So would appreciate any help or guidance for this subject matter.
You can't.  Kolmogorov complexity is not computable.  See, e.g., https://en.wikipedia.org/wiki/Kolmogorov_complexity.