True Randomness - What Does it Mean?

  • Thread starter Thread starter iamnew
  • Start date Start date
  • Tags Tags
    Randomness
iamnew
Messages
13
Reaction score
0
hello guys. What does true randomness mean

Is it that you cannot predict the next number in the sequence ? Can repeating of numbers take place ?
 
Physics news on Phys.org
iamnew said:
Is it that you cannot predict the next number in the sequence ?
There are probably more technical definition but - yes

Can repeating of numbers take place ?
Yes, otherwise you would know what the next digit couldn't be - and so the value becomes 10% more predictable or less random
 
iamnew said:
hello guys. What does true randomness mean

Is it that you cannot predict the next number in the sequence ? Can repeating of numbers take place ?

Randomness does not exist.
 

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 Random variable vs Random Process
Replies
2
Views
2K
I Random variable and elementary events
Replies
9
Views
2K
I Sample space, outcome, event, random variable, probability...
Replies
6
Views
3K
A Concrete examples of randomness in math vs. probability theory
Replies
11
Views
2K
I Experiment with gamers, random numbers and entanglement
Replies
5
Views
2K
I Sampling theory and random sample
Replies
5
Views
2K
B Probability a randomly chosen natural number, which is not smaller than 𝑥, is greater than x?
Replies
15
Views
1K
Does True Randomness Exist or Is It Just an Illusion?
Replies
30
Views
4K
Is the Mean of a Sum of Randomly Chosen Numbers Always 1?
Replies
6
Views
3K
I Linear regression and random variables
Replies
30
Views
4K

Hot Threads

Recent Insights

Back
Top