[twothreeone]

> 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.

[cgio]

Actually it’s Solomonoff. But it’s called Solomonoff-Kolmogorov-Chaitin. So Chaitin is among the few people entitled to call it something and AIT is real and less pretentious than using his name.