Why is random not so random?

Question

Can anyone explain how modern programming languages ​​(java, C #, python, javascript) deal with randomness constraints and where those constraints arise (e.g. time-based seeds). I.E. if they are superimposed by basic operating systems and hardware based on Intel.

In principle, I would like to understand why there is no such thing as a truly random number without the corresponding equipment.

Answer 1

First, I will answer the second part of your question:

In principle, I would like to understand why there is no such thing as a truly random number without the corresponding equipment.

- , . , , , , . , , %d0 24, register %d1 42, , add %d0 %d1 %d2, %d2 66. , x = 1; y = 2; z = x + y , z 3 .

; , , . . , , , . , , (, , ). , - , . , , , , ?

,

[yo] u, - ?

. , . , , , .

- , ... ... .

, , , ( :-)). , , (, /dev/random , ), . , . , , , , , , , ( ) . , , , " ". ! : , , ​​ .

, : , , ( ). , .

Answer 2

. , , , , . , , , (.. Timestamp) , . , , .

, , .

Wikipedia,

, . Linux , , (, , / ) . , , . , .

Answer 3

, , . , .

Answer 4

, . , , - . , , , - - , . , random.org, , . , ?:-P

Answer 5

:
 -
 - , , ( 0 1, 1 100 ..).

, . ( ) ,

These generated numbers are processed to get numbers from only 1 to 100 or from 0 to 1 (for example) so that they are useful for your program. Since the original algorithm is not able to generate all numbers in the range, the result set will receive some numbers more often than others.