What does Birth-Time Error and Boundary Flips conclude, in numbers, about “Information Bounds: How Many Bits a Report Leaves and a Question Buys”?
Answer: Chapters 4 and 5 use entropy, Chernoff information and expected information gain to bound the number of questions: items right eight times in ten need 7, items right six times in ten need 67.
Scope of the numbers: Its parameters are illustrative, and all calculations are generated by its programs. Chapter 1 shows that in the illustrative model 0.2782 of remembered times fall exactly on a double-hour boundary, against 0.0083 without rounding.
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: 67
| a | b | I(bits) | C(bits) | n for error <= 0.05 | 1/I |
| 0.95 | 0.05 | 0.7136 | 1.1980 | 1 | 1.4 |
| 0.90 | 0.10 | 0.5310 | 0.7370 | 3 | 1.9 |
| 0.80 | 0.20 | 0.2781 | 0.3219 | 7 | 3.6 |
| 0.70 | 0.30 | 0.1187 | 0.1258 | 17 | 8.4 |
| 0.60 | 0.40 | 0.0290 | 0.0294 | 67 | 34.4 |
| 0.55 | 0.45 | 0.0072 | 0.0072 | 269 | 138.4 |
| 0.30 | 0.10 | 0.0468 | 0.0488 | 40 | 21.4 |
| 0.50 | 0.50 | 0.0000 | 0.0000 | never (no information) |
Show the full program
# Chapter 4. p42: a past-event question is a noisy channel.
# Two candidate double hours A and B, equal prior. A question is
# answered "yes" with probability a under A and b under B (both
# illustrative; no published study supplies such numbers). Per
# question we print the mutual information I (bits) between the
# candidate and the answer, the Chernoff information C (bits; the
# exponent of the Bayes error), and the exact smallest number n of
# independent questions for which the Bayes error with equal priors,
# 0.5 * sum_k min(Bin(k; n, a), Bin(k; n, b)),
# is at most 0.05. A perfect question has I = 1 and needs n = 1.
import math
def h2(p):
if p <= 0.0 or p >= 1.0:
return 0.0
return -p * math.log2(p) - (1 - p) * math.log2(1 - p)
def mutual(a, b):
return h2(0.5 * (a + b)) - 0.5 * (h2(a) + h2(b))
def chernoff(a, b):
def f(lam):
return math.log2(a ** lam * b ** (1 - lam)
+ (1 - a) ** lam * (1 - b) ** (1 - lam))
lo, hi = 0.0, 1.0
for _ in range(100):
m1, m2 = lo + (hi - lo) / 3, hi - (hi - lo) / 3
if f(m1) < f(m2):
hi = m2
else:
lo = m1
return max(0.0, -f(0.5 * (lo + hi)))
def bayes_error(n, a, b):
terms = [min(math.comb(n, k) * a ** k * (1 - a) ** (n - k),
math.comb(n, k) * b ** k * (1 - b) ** (n - k))
for k in range(n + 1)]
return 0.5 * math.fsum(terms)
def n_needed(a, b, target=0.05):
n = 1
while bayes_error(n, a, b) > target + 1e-12:
n += 1
return n
PAIRS = [(0.95, 0.05), (0.90, 0.10), (0.80, 0.20), (0.70, 0.30),
(0.60, 0.40), (0.55, 0.45), (0.30, 0.10), (0.50, 0.50)]
print(" a b I(bits) C(bits) n for error <= 0.05 1/I")
for a, b in PAIRS:
i = mutual(a, b)
if i == 0.0:
print("%.2f %.2f %7.4f %7.4f never (no information)"
% (a, b, i, chernoff(a, b)))
continue
print("%.2f %.2f %7.4f %7.4f %6d %15.1f"
% (a, b, i, chernoff(a, b), n_needed(a, b), 1.0 / i))Single source and citation
Fan, Y. (2026). Error Propagation from Remembered Birth Times and Robust Chart Fixing: Flip Probabilities at Double-Hour Boundaries and the Fewest Past-Event Questions (Version 1.0.0), Chapter 4: Information Bounds: How Many Bits a Report Leaves and a Question Buys. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-284 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026284,
author = {Fan, Yafu},
title = {Error Propagation from Remembered Birth Times and Robust Chart Fixing: Flip Probabilities at Double-Hour Boundaries and the Fewest Past-Event Questions},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Heaping in Reported Times: Full Hours, Half Hours and a Rounding Mixture
- Chapter 2 · A Quarter Hour Either Side of the Boundary: Exact Flip Probabilities
- Chapter 3 · Cell Widths and Stacked Layers: Ke, Double Hours and Rising Signs
- Chapter 5 · Bayesian Updating and Choosing Items by Information Gain
- Chapter 6 · After-the-Fact Matches: Loose Matching, Optional Stopping and Double Counting
- Chapter 7 · Classics East and West: Shen Kuo on the Water Clock and Bessel's Personal Equation
- Chapter 8 · The Tollbooth Birth-Time Calibration Questionnaire: Read-Only Advice and a Pre-Registered Test