Can Computers Generate Random Numbers?

flotsam
Messages
29
Reaction score
0
Simple question: Can computers create 'truly' random numbers?
 
Physics news on Phys.org
I guess you have to play the "define random" game to get a good answer.

But simply put, no computer today can get a truly random number. They are all "pseudo random", which means you take a seed number (like, the amount of milliseconds passed since midnight) and run it through a one way hash.

Quantum computers might be able to do it, due to inherent uncertainties in QM, which suggests you can get a truly random seed. How that would work technically, I am not sure.

If you happen to believe in determinism on all scales, then there is no such thing as a random number. It simply cannot be made.

k
 
NO, but see this physical random number generator:

The Araneus Alea I USB True Random Number Generator is a compact USB device that generates high-quality true random numbers.
The Alea I uses a reverse biased semiconductor junction to generate wide-band Gaussian white noise. This noise is amplified and digitized using an analog-to-digital converter.

http://www.araneus.fi/products-alea-eng.html
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I Experiment with gamers, random numbers and entanglement
Replies
5
Views
2K
Comp Sci How to Generate Random Numbers in C++ Using `<random>`?
Replies
4
Views
2K
I Understanding Randomness in Brownian Matter
Replies
4
Views
1K
B Probability a randomly chosen natural number, which is not smaller than 𝑥, is greater than x?
Replies
15
Views
1K
A Concrete examples of randomness in math vs. probability theory
Replies
11
Views
3K
I Given three random numbers between 0 and 1, how to evenly populate a sphere?
Replies
15
Views
2K
I Is there always a matrix corresponding to eigenvectors?
Replies
24
Views
3K
I Stratified sampling based on properties of random number streams
Replies
1
Views
1K
Random Seed Choice for LAMMPS Molecular Dynamics Simulations
Replies
21
Views
5K
Can a Formula Create True Randomness?
Replies
1
Views
3K

Hot Threads

Recent Insights

Back
Top