Editing Chaitin's constant (section)

== Algorithmic randomness ==
A real number is random if the binary sequence representing the real number is an [[algorithmically random sequence]]. Calude, Hertling, Khoussainov, and Wang showed<ref>{{cite conference |last1=Calude |first1=Cristian S. |title=Recursively Enumerable Reals and Chaitin &Omega; numbers |date=1998 |url=https://www.cs.auckland.ac.nz/~cristian/samplepapers/omegastacs.pdf |archive-url=https://web.archive.org/web/20040119142843/http://www.cs.auckland.ac.nz/~cristian/samplepapers/omegastacs.pdf |archive-date=2004-01-19 |url-status=live |conference=[[Symposium on Theoretical Aspects of Computer Science|STACS 98]] |volume=1373 |pages=596–606 |publisher=Springer |location=Berlin, Heidelberg |doi=10.1007/bfb0028594 |isbn=978-3-540-64230-5 |access-date=2022-03-20 |last2=Hertling |first2=Peter H. |last3=Khoussainov |first3=Bakhadyr |last4=Wang |first4=Yongge|bibcode=1998LNCS.1373..596C |s2cid=5493426 }}</ref> that a recursively enumerable real number is an algorithmically random sequence if and only if it is a Chaitin's {{math|&Omega;}} number.