Strong noncomputability of random strings
Cristian S. Calude, Ion Chițescu · International Journal of Computer Mathematics · 1982
We prove that every infinite set of random strings is not recursively enumerable. In particular, the set of all random strings is not recursively enumerable. This property asserts that in a strong sense random strings are not constructable.