I've been looking for a full, detailed proof that Chaitin's constant is incompressible, i.e. there is a universal constant $c$ such that every program writing first $n$ digits of $\Omega$ has length at least $n-c$. I wasn't able to find such detailed proof, so I'm asking this question.

Thanks in advance!

Use

commentsto ask for more information or clarify a question or answer.You can always comment on

your ownquestions and answers. Once you earn 50 reputation, you can comment on anybody's post.Remember: we're all here to learn, so be friendly and helpful!