5D Library › Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation · 中文
Chapter 6. The Card as an Action Anchor
What a daily card can actually do
If a card cannot know the future, can it still help? One plausible route has nothing to do with content: a card narrows a choice and marks a start. Choosing among many similar options takes time that grows with their number (the Hick-Hyman law in reaction-time research (Hick 1952)), and undecided time is when attention drifts. A pointer that names one task removes most of the choosing. Two meta-analyses give reference points: plans of the form “if situation X arises, I will do Y” (implementation intentions) had a medium-to-large average effect on goal attainment, d = 0.65 (Gollwitzer and Sheeran 2006); the much-cited “choice overload” effect averaged close to zero across studies, D = 0.02 (Scheibehenne et al. 2010). The toy model below makes the mechanism explicit; its parameters are illustrative.
Calculation
# Chapter 6. p11: A toy model of action paralysis and the daily card.
# A work block starts with a choice among K similar tasks. Choosing takes
# T = a + b log2(K + 1) minutes (Hick-Hyman form, a = 5, b = 10), and
# every 10 undecided minutes the person drifts off with probability 0.15
# for the rest of the block. Aids: a card (or a coin) names one task and
# is followed with probability c, else the full choice is made after 2
# lost minutes; an if-then plan written the evening before is followed
# with probability 0.8. 25 blocks a week. All parameters illustrative.
# Reference points, not inputs: implementation intentions d = 0.65
# (Gollwitzer and Sheeran); choice overload mean D = 0.02 (Scheibehenne).
import math
A, B, DRIFT = 5.0, 10.0, 0.15
def p_start(k, lost=0.0):
t = A + B * math.log2(k + 1) + lost
return (1 - DRIFT) ** (t / 10)
def with_pointer(k, c):
return c * p_start(1) + (1 - c) * p_start(k, 2.0)
def with_plan(k, adh=0.8):
return adh * (1 - DRIFT) ** (A / 10) + (1 - adh) * p_start(k, 2.0)
if __name__ == "__main__":
print(" K free choice card/coin c=0.5 c=0.8 if-then plan")
for k in (2, 6, 12):
print(" {:2d} {:.3f} {:.3f} {:.3f} "
"{:.3f}".format(k, p_start(k), with_pointer(k, 0.5),
with_pointer(k, 0.8), with_plan(k)))
base = 25 * p_start(6)
card = 25 * with_pointer(6, 0.8)
plan = 25 * with_plan(6)
print(" K=6, blocks started a week: free {:.1f}, card {:.1f} "
"(+{:.1f}), plan {:.1f}".format(base, card, card - base, plan))
# K free choice card/coin c=0.5 c=0.8 if-then plan
# 2 0.713 0.737 0.765 0.876
# 6 0.584 0.675 0.740 0.851
# 12 0.505 0.636 0.725 0.835
# K=6, blocks started a week: free 14.6, card 18.5 (+3.9), plan 21.3With 6 similar tasks, a free choice gets a work block started with probability 0.584. A card or a coin that names one task and is followed 80% of the time raises this to 0.740; an if-then plan written the evening before, to 0.851. Over 25 blocks a week, that is 14.6 blocks started without help, 18.5 with the card (+3.9) and 21.3 with the plan. The model assigns the card no special power: a coin with the same compliance gives the same number. Whatever behavioural gain a daily card brings should be credited to narrowing and commitment, which a plain plan does better.
Is a random pointer a bad decision rule?
Picking at random sounds irrational. It is not, when the options are close in value and deliberation costs time. In the next model six tasks differ in true value by a spread (in hours of good work), and deliberating longer gives better estimates but costs a sixtieth of an hour a minute.
Calculation
# Chapter 6. p12: When is a random pointer as good as deliberating?
# K = 6 tasks have true values drawn from Normal(0, s) (value in hours
# of good work). Deliberating for D minutes gives each a noisy estimate
# with error sd 1/sqrt(1 + D/10); the best estimate is chosen. Each
# minute spent costs 1/60 hour. A random pointer picks any task at no
# cost. 20,000 trials per cell, seed 89; mean net value is reported.
import math
import random
def net(s, D, rng, trials=20000, k=6):
tot = 0.0
err = 1 / math.sqrt(1 + (D or 0) / 10)
for _ in range(trials):
v = [rng.gauss(0, s) for _ in range(k)]
if D is None:
tot += v[rng.randrange(k)]
continue
est = [x + rng.gauss(0, err) for x in v]
tot += v[est.index(max(est))] - D / 60
return tot / trials
if __name__ == "__main__":
rng = random.Random(89)
print(" spread s random D=5 min D=15 min D=45 min")
for s in (0.1, 0.3, 1.0):
row = [net(s, None, rng)] + [net(s, D, rng) for D in (5, 15, 45)]
print(" {:6.1f} {:7.3f} {:7.3f} {:8.3f} {:8.3f}".format(
s, *row))
# spread s random D=5 min D=15 min D=45 min
# 0.1 0.001 -0.069 -0.231 -0.720
# 0.3 -0.005 0.044 -0.088 -0.532
# 1.0 -0.005 0.893 0.823 0.413When the tasks are nearly equal (), a random pick nets 0.001 hours, while 5 minutes of deliberation nets -0.069 and 45 minutes -0.720: deliberation only loses. At , a short deliberation pays slightly (0.044) and long ones lose. Only when the tasks really differ () does deliberation clearly win: 0.893 for 5 minutes against -0.005 for a random pick. A random pointer is a sound rule for near-ties, and a poor one for real choices; a card should be used for the first kind only.
Note
No claim of foresight. The behavioural argument in this chapter needs no assumption that the card means anything. It applies equally to a die, a coin or a numbered list. That is its strength: it can be tested against exactly such controls (Chapter 8).
Summary
In an illustrative model, a daily card followed 80% of the time raises the chance of starting a work block from 0.584 to 0.740, the same as a coin, and less than an if-then plan (0.851). A random pointer is a good rule when the options are nearly equal and a bad one when they differ.
References
Fan, Y. (2026). Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation: REM Semantic Spreading, SHA-256 Fisher-Yates Permutations and Retroactive Coincidence Rates [梦境意象二分图、确定性哈希牌卡与潜意识先验激活] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090233 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).