What does Retrodiction and Upsell Automata conclude, in numbers, about “Testing Retrodiction Fairly: Sequential Tests and Selective Recall”?

Answer: Chapter 2 gives a three-way sequential test and shows that selective recall turns statements right half the time into a remembered accuracy of 0.7493, against 0.4995 when recorded beforehand.

Scope of the numbers: Marked boxes separate evidence, 16 runnable Python programs, classical sources and hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.4995, 0.7493

accuracy mean median share >0.8
recalled0.7493 0.7500 0.4193
written down0.4995 0.4667 0.0174
expected recalled accuracy 0.9/(0.9+0.3)0.7500
Reading: with ordinary selective recall a reader with no
insight is remembered as right three times in four, and two
clients in five remember 80% or more. Writing the statements
down beforehand removes the effect entirely.
Show the full program
# Chapter 2. [p04] Selective recall turns chance into "accuracy".
# A reader with no insight makes 15 yes/no retrodictions, one for each
# of the past 15 years ("a hard year", "a good year"); each is right
# with probability 0.5. The client later recalls a right one with
# probability 0.9 and a wrong one with probability 0.3, and judges the
# reader by the share right among those she recalls. 50,000 clients
# (seed 69). Compared: perceived accuracy with recall, and accuracy
# when all 15 statements were written down beforehand.
import random

N, YEARS = 50000, 15

if __name__ == "__main__":
    rng = random.Random(69)
    seen, written, over = [], [], 0
    for _ in range(N):
        right = [rng.random() < 0.5 for _ in range(YEARS)]
        rec = [r for r in right if rng.random() < (0.9 if r else 0.3)]
        acc = sum(rec) / len(rec) if rec else 0.0
        seen.append(acc)
        written.append(sum(right) / YEARS)
        over += acc >= 0.8
    seen.sort()
    written.sort()
    print("   accuracy        mean    median  share >= 0.8")
    print("   recalled      {:.4f} {:9.4f} {:13.4f}".format(
        sum(seen) / N, seen[N // 2], over / N))
    print("   written down  {:.4f} {:9.4f} {:13.4f}".format(
        sum(written) / N, written[N // 2],
        sum(w >= 0.8 for w in written) / N))
    print("   expected recalled accuracy 0.9/(0.9+0.3) = {:.4f}".format(
        0.9 / 1.2))
    print("\nReading: with ordinary selective recall a reader with no")
    print("insight is remembered as right three times in four, and two")
    print("clients in five remember 80% or more. Writing the statements")
    print("down beforehand removes the effect entirely.")

Single source and citation

Fan, Y. (2026). Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata (Version 1.0.0), Chapter 2: Testing Retrodiction Fairly: Sequential Tests and Selective Recall. 5D Library. https://doi.org/10.5281/zenodo.24090186

DOI: 10.5281/zenodo.24090186 · Read the monograph · 5DL-B-069 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026069,
  author    = {Fan, Yafu},
  title     = {Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090186},
  url       = {https://doi.org/10.5281/zenodo.24090186}
}

Other chapter answers in this book