In the book The Algorithmic Foundations of Differential Privacy by Cynthia Dwork, Aaron Roth on page 16 (actually page 20 in the pdf viewer) it says at the very bottom of the page:
Definition 2.2 (Randomized Algorithm). A randomized algorithm ℳ with domain A and discrete range B is associated with a mapping M : A → ∆(B). On input a ∈ A, the algorithm ℳ outputs ℳ(a) = b with probability (M(a))b for each b ∈ B. The probability space is over the coin flips of the algorithm ℳ.
What does the final sentence mean?
Someone said the authors might mean that once you've performed the recipe described in that paragraph, you perform the plausible-deniability double-coin-flip trick described under 2.3 on page 15. Is that what is meant?