What does Attention Networks and Intrinsic Motivation conclude, in numbers, about “Attention Is Not a Single Tap: The Three-Network Model and the Attention Network Test”?

Answer: With these illustrative parameters the program's reliabilities (expected: alerting 0.36, orienting 0.50, conflict 0.83; simulated: 0.36, 0.56, 0.84) are close to MacLeod and colleagues' values, which shows only that the explanation is plausible: a difference inherits the measurement error of two conditions, while people may genuinely differ little on that difference. To bring the alerting score up to a reliability of 0.7, these parameters require about 192 trials per condition in each half, four times the session length assumed here.

Scope of the numbers: This book is not diagnosis or treatment advice for ADHD, anxiety, depression or any other condition, and deals with no medication or dose. Marked boxes separate published evidence, runnable Python calculations (16 programs, all checked), 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.36, 0.50, 0.56, 0.83, 0.84, 192

network | true SD | trials per cond. | simulated split-half | expected
alerting |12 | 48 | 0.36 | 0.36
orienting |16 | 48 | 0.56 | 0.50
conflict |25 | 96 | 0.84 | 0.83
alerting reliability as the session gets longer (trials per condition in each half):
240.22 48: 0.36 96: 0.53 192: 0.70 384: 0.82

Key formula

\[\text{警觉} = RT_{\text{无提示}} - RT_{\text{双提示}}\]
Show the full program
# Split-half reliability of a difference score: true between-person SD vs trial noise.
# Reliability = true variance / observed variance. SDs and noise are illustrative.
import random, math
random.seed(7)
NOISE = 110.0                      # trial-to-trial RT noise (ms)
TRUE_SD = {"alerting": 12.0, "orienting": 16.0, "conflict": 25.0}
TRIALS = {"alerting": 48, "orienting": 48, "conflict": 96}   # trials per condition in one half

def split_half(sd, n_trials, people=400):
    halves = []
    for _ in range(people):
        t = random.gauss(0, sd)
        h = []
        for _half in range(2):
            se = NOISE * math.sqrt(2 / n_trials)          # SE of a difference of two means
            h.append(t + random.gauss(0, se))
        halves.append(h)
    x = [h[0] for h in halves]; y = [h[1] for h in halves]
    mx, my = sum(x) / len(x), sum(y) / len(y)
    sxy = sum((a - mx) * (b - my) for a, b in zip(x, y))
    r = sxy / math.sqrt(sum((a - mx) ** 2 for a in x) * sum((b - my) ** 2 for b in y))
    return 2 * r / (1 + r)                                # Spearman-Brown to full length

def expected(sd, n_trials):
    err = NOISE ** 2 * 2 / (2 * n_trials)                 # error variance of the full-length score
    return sd ** 2 / (sd ** 2 + err)

print("network    | true SD | trials per cond. | simulated split-half | expected")
for k in TRUE_SD:
    sim = split_half(TRUE_SD[k], TRIALS[k])
    print(f"{k:10s} | {TRUE_SD[k]:7.0f} | {TRIALS[k]:16d} | {sim:20.2f}"
          f" | {expected(TRUE_SD[k], TRIALS[k]):8.2f}")
print("alerting reliability as the session gets longer (trials per condition in each half):")
sd_a = TRUE_SD["alerting"]
print("   " + "  ".join(f"{n}: {expected(sd_a, n):.2f}" for n in (24, 48, 96, 192, 384)))

Single source and citation

Fan, Y. (2026). Attention Networks, the Working-Memory Bottleneck and Self-Determination Theory (Version 1.0.0), Chapter 1: Attention Is Not a Single Tap: The Three-Network Model and the Attention Network Test. 5D Library. https://doi.org/10.5281/zenodo.23761341

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

BibTeX
@book{fan2026024,
  author    = {Fan, Yafu},
  title     = {Attention Networks, the Working-Memory Bottleneck and Self-Determination Theory},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23761341},
  url       = {https://doi.org/10.5281/zenodo.23761341}
}

Other chapter answers in this book