Randomness
Randomness is the property of a process or outcome involving chance or probabilistic variation rather than being fully determined by available conditions.
Learn AI-Assisted Python Programming, Second Edition
Randomness is the property of an outcome or event being determined by chance rather than being fully predictable from the available information.
- How it is used
- Uses chance to add variety, surprise, risk, and uncertainty to games and to explain variable large-language-model outputs.
- How deep it goes
- Explains Python integer and floating-point generation with examples, then applies it to games without developing randomness internals.
- Examples
- Demonstrates random digits, dice rolls, floating-point values, secret codes, enemy behavior, puzzle orientation, and attack damage.
- What you can do after
- Apply it via Python's random module to generate inclusive integers and floating-point values for simple games.
Read how Learn AI-Assisted Python Programming, Second Edition explains randomness →
Statistics Slam Dunk
Randomness is the absence of a deterministic pattern in the occurrence of outcomes, subject to probabilistic regularities.
- How it is used
- Frames sports analysis around distinguishing random streaks from genuine order, causality, and hot-hand claims.
- How deep it goes
- Explains simulation, independent trials, streak calculations, and player-level interpretation, but stops short of formal probability proofs.
- Examples
- Uses fair-coin simulations and 2019–20 NBA free-throw streaks from Giannis Antetokounmpo and James Harden.
- What you can do after
- Apply it via R simulations and streak analysis to evaluate whether apparent success patterns exceed random variation.
Real-World Cryptography
Randomness is the property of outcomes or data being difficult to predict and lacking a discernible deterministic pattern.
- How it is used
- Supplies unpredictable values for cryptographic keys, nonces, IVs, challenges, and prime numbers.
- How deep it goes
- Explains unpredictability, uniform distributions, physical sources, PRNG failures, and conservative sourcing, without implementation-level generation details.
- Examples
- Uses dice, lottery numbers, calculator sequences, chaotic physical phenomena, and the Debian-era OpenSSL PRNG failure.
- What you can do after
- Apply it by choosing operating-system or trusted-library randomness and avoiding predictable or noncryptographic PRNGs.
Hacking Cryptography
Randomness is the absence of a predictable pattern in an outcome or sequence according to a specified model of probability.
- How it is used
- Frames randomness as a foundational security input for cryptographic confidentiality, integrity, authenticity, and secret generation.
- How deep it goes
- Explains unpredictability, contrasts RNG types, traces entropy sourcing, and identifies weak randomness as an algorithm-breaking failure.
- Examples
- Uses calculator RAND, magician-selected numbers, cryptographic keys and salts, and predictable ECDSA nonces as concrete examples.
- What you can do after
- Evaluate cryptographic implementations for randomness dependencies and diagnose how poor-quality random input can nullify algorithmic security.
Causal AI
Randomness is the absence of a deterministic specification of an outcome, represented in a model by stochastic variation or random variables.
- How it is used
- Frames stochastic variation for probabilistic generative modeling, causal modeling, inference, and decision-making.
- How deep it goes
- Defines random variables, probability interpretations, deterministic data-generating processes, and computational sampling, but defers detailed inference algorithms.
- Examples
- Uses repeated die rolls, three-sided dice, coin flips, and Pyro random-process models.
- What you can do after
- Evaluate/understand how models represent variation through random variables, distributions, probability interpretations, and generated samples.
Related concepts
- entropymeasured by · Entropy is a quantitative measure of uncertainty or dispersion in a probability distribution and, more generally, of disorder in the possible states of a system.
- random variableused by · A random variable is a function that assigns numerical values to outcomes of a random process and is characterized by a probability distribution.
- probabilistic modelpart of · A probabilistic model represents uncertainty by specifying probability distributions over variables, observations, events, or outcomes.
- temperatureconfigured by · A temperature parameter adjusts the concentration of a probability distribution, affecting sampling randomness or the likelihood of accepting less favorable transitions.
- data explorationproduces · Data exploration is the systematic examination and summarization of data to understand its structure, quality, distributions, relationships, patterns, and anomalies.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.