N@N

Can Computers Generate Truly Random Numbers? It's Complicated

The article from MSN discusses the complexity of generating truly random numbers by computers. Traditionally, computers use algorithms known as Pseudo-Random Number Generators (PRNGs) which produce sequences that appear random but are actually deterministic and predictable if one knows the initial state or "seed." These are not suitable for applications requiring high security or unpredictability, like cryptography. To address this, computers can harness physical phenomena for randomness, such as thermal noise, radioactive decay, or even the timing of user inputs like keystrokes. However, these methods also have limitations; for instance, they might not be as random as needed or could be influenced by external factors. The article explains that while computers can approximate randomness through these physical sources, achieving true randomness remains elusive due to the deterministic nature of computing hardware. It also touches on quantum computing, which might offer a solution through quantum randomness, but this technology is still in its infancy. Thus, the quest for true randomness in computing involves a blend of algorithmic approaches and physical randomness sources, each with its own set of challenges and compromises.

Read the Full MSN Article at:
[ https://www.msn.com/en-us/news/technology/can-computers-generate-truly-random-numbers-it-s-complicated/ar-AA1waWOm ]