> To prove that Ω is computationally and therefore logically irreducible, requires a theory of program-size complexity that I call algorithmic infor- mation theory (AIT) [Chaitin, 2005]

Interesting, I think everyone else calls this Kolmogorov complexity.