Hence God must have computational power greater than a Turing machine, at least if he wants to prove His hash function minimises Kolmogorov complexity. For a r

Hence God must have computational power greater than a Turing machine, at least if he wants to prove His hash function minimises Kolmogorov complexity. For a rough upper bound, there are some examples at [0], which could be less than 100 characters of C (once golfed). [0] https://stackoverflow.com/a/14409947/5327391 https://stackoverflow.com/a/14409947/5327391