Pseudorandom and Determinism

---

• In computing, it is difficult to compute purely random numbers via software alone
• specialized hardware can, though
  • e.g.,
    • trigger a signal when a cosmic ray hits a detector
    • pretty close to perfectly random over time

Deterministic algorithms always produce the same result, given the same input and series of events.

• if we look at a very large set of numbers
  • can calculate the degree of statistical randomness that set represents
• if use a deterministic algorithm to produce this set of numbers, using a seed value as a key input, we call the set of numbers pseudorandom:
  • the set as a whole exhibits statistical randomness, but given the value of the sequence and knowing the algorithm and the see, the next element of the sequence—the value—can be determined.

Entropy is a measure of the randomness of a system.

• comes from thermodynamics