What does The Fewest Questions conclude, in numbers, about “Estimation Theory for a Birth Time: Rounding Error, Sequential Tests and "It Matched Afterwards"”?
Answer: Chapter 6 treats birth-time rectification as an estimation problem: a record rounded to the hour lands in the wrong block with probability 0.2500; with discrimination of 0.7 against 0.3 a sequential test still needs 9.35 questions on average between adjacent blocks; and when the questions do not discriminate, a standard of eight matches out of ten is passed by luck among twelve candidates with probability 0.4908.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's 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.2500
| rounding g (min): | 60 | 30 | 15 | 5 | |
| recall sd 0 | min: | 0.2500 | 0.1250 | 0.0625 | 0.0208 |
| recall sd 10 | min: | 0.2500 | 0.1257 | 0.0796 | 0.0679 |
| recall sd 20 | min: | 0.2513 | 0.1591 | 0.1393 | 0.1337 |
| recall sd 40 | min: | 0.3175 | 0.2781 | 0.2688 | 0.2660 |
| share of hourly records on a block boundary: 0.5000 |
Show the full program
# Chapter 6. p61: how often a rounded or recalled clock time falls in
# a different two-hour block. Exact interval arithmetic, illustrative.
# 一天分 12 个两小时时段,分界在奇数整点(23 点、1 点、3 点等)。
# 真实时刻在一天内均匀;记录 = 四舍五入到 g 分钟,再加回忆误差
# N(0, s^2)(按 1 分钟格离散到正负 4 s)。落在分界线上的记录按惯例
# 归入后一时段。输出:记录所在时段与真实时段不同的概率。
import math
from statistics import NormalDist
DAY = 1440
def block(minute):
return int(((minute + 60) % DAY) // 120)
def overlap(lo, hi, b):
# 区间 [lo, hi) 与第 b 时段 [120b - 60, 120b + 60) 的重叠长度
parts = []
for shift in (-DAY, 0, DAY):
a0, a1 = 120 * b - 60 + shift, 120 * b + 60 + shift
parts.append(max(0.0, min(hi, a1) - max(lo, a0)))
return math.fsum(parts)
def p_mismatch(g, s):
if s == 0:
offs = [(0, 1.0)]
else:
nd = NormalDist(0.0, s)
span = int(4 * s)
offs = [(d, nd.cdf(d + 0.5) - nd.cdf(d - 0.5))
for d in range(-span, span + 1)]
z = math.fsum(w for _, w in offs)
offs = [(d, w / z) for d, w in offs]
terms = []
for k in range(DAY // g):
rec = k * g
lo, hi = rec - g / 2.0, rec + g / 2.0
for d, w in offs:
right = overlap(lo, hi, block(rec + d))
terms.append(w * (g - right))
return math.fsum(terms) / DAY
GS = (60, 30, 15, 5)
SS = (0, 10, 20, 40)
print("rounding g (min): " + "".join("%-9d" % g for g in GS))
for s in SS:
print("recall sd %-3d min: " % s
+ "".join("%-9.4f" % p_mismatch(g, s) for g in GS))
print("share of hourly records on a block boundary: %.4f" % (12 / 24))Single source and citation
Fan, Y. (2026). Fisher Information Matrices and the Cramér-Rao Bound: the Fewest Questions Needed to Estimate a Budget or a Birth Time (Version 1.0.0), Chapter 6: Estimation Theory for a Birth Time: Rounding Error, Sequential Tests and "It Matched Afterwards". 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-235 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026235,
author = {Fan, Yafu},
title = {Fisher Information Matrices and the Cramér-Rao Bound: the Fewest Questions Needed to Estimate a Budget or a Birth Time},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Fisher Information and the Cramér-Rao Bound: How Precise Can a Questionnaire Be?
- Chapter 2 · The Information Ceiling of Correlated Questions: Why the Sixth Question Is Nearly Wasted
- Chapter 3 · An Item Response Model for Budget Questions: How Tightly Do Five Ladder Answers Pin Down a Budget?
- Chapter 4 · Adaptive Selection: the Maximum-Information Rule and an Information-Theoretic Floor on the Number of Questions
- Chapter 5 · The Fisher Information Matrix: Yes-Saying, Reverse-Keyed Questions and Optimal Design
- Chapter 7 · Classical Sources East and West: "Knocking at Both Ends" and Fisher's Amount of Information
- Chapter 8 · Closing the Loop: a Five-Question Pre-Sale Budget Questionnaire, a Read-Only Question Order and a Pre-Registered Test