# Can pure randomness be computed?

Algorithm for randomness usually use seed, and thus having an unique input it cannot be said to be completely random, so can pure randomness be theoretically computed?

• Are you referring to things like the statistical bell curve? Mar 25, 2019 at 18:44
• Not sure what you mean by that. What I mean by randomness is the output of random numbers. Mar 25, 2019 at 18:49
• I assume "computed" means "generated". Yes, just use a Geiger counter. Mar 25, 2019 at 20:49
• Computation is the definitional opposite of randomness, so no. If a sequence of numbers (or decimal digits) is generated by a computation in the sense of Turing, then it is not random. However of course the digits themselves may pass all known statistical tests for randomness; in which case as you note we call it pseudo-random. To be clear I'm equating the meaning of random with what Turing called non-computable. Mar 25, 2019 at 23:40
• @JohnForkosh I know, but it was the best I could make of a question that basically asks "can we do X by a process that is, by definition, incompatible with doing X?" Mar 26, 2019 at 4:08