There are no mathematical theories of runaway intelligence growth. On the other hand there are many theorems of fundamental limits to maechanical processes. E.g. NP completeness codiscoverer Leonid Levin also proved what he calls independence conservation that states no stochastic process is expected to increase net mutual information. Then there are the more well known theorems with similar implications: no free lunch theorems, halting problem, Kolmogorov complexity's uncomputability, data processing inequality, and so on. There is absolutely nothing that looks like runaway intelligence explosion in theoretical computer science. The closest attempt I have seen in Kauffman's analysis of NK problems, but there he finds similar limitations, except with low K terrains, but that analysis is a bit questionable in mind. To make arguments like gwern and Kurzweil they are essentially appealing to mysticism; assuming there is a yet to be discovered mathematical law utterly unlike anything we have ever discovered. They are engaging in promissory computer science, writing a whole bunch of theory checks they hope will be cashed in the future.