Appendices

Appendix A

Notation and Conventions

Definition

A.1 Sets, relations, words

Notation Meaning
[n][n] {1,…,n}\{1, \dots, n\} (or {0,…,n−1}\{0, \dots, n-1\} where stated)
Σ\Sigma, Σ∗\Sigma^*, ε\varepsilon an alphabet of moves; all finite words over it; the empty word
∣w∣\lvert w \rvert length of a word ww
πΓ(w)\pi_\Gamma(w) projection of ww onto the letters in Γ\Gamma
R;SR \then S relational composition: first RR, then SS
Rel⁡(A)\Rel(A) the relations on AA
⟦a⟧\sem{a}, ⟦w⟧\sem{w}, ⟦L⟧\sem{\Lang} meaning of a move, a word, a language (Definition Definition 6.1)
⟦w⟧(x)=∅\sem{w}(x) = \varnothing ww is undefined at xx
dom⁡f\dom f domain of a partial map
L\Lang an admissibility language
D=(Q,Σ,δ,q0,F)D = (Q, \Sigma, \delta, q_0, F) a deterministic automaton with partial δ\delta; ∣Q∣\lvert Q \rvert its number of states
A=(A;R1,… )\Str = (A; R_1, \dots) a computational structure
G=(Σ,A,⟦⋅⟧,L)G = (\Sigma, \Str, \sem{\cdot}, \Lang) an operational grammar (Definition Definition 7.1)

A.2 Numbers, bits, asymptotics

Notation Meaning
ww (in cost statements) the machine word size in bits; context distinguishes it from a word w∈Σ∗w \in \Sigma^*
⌊x⌋\lfloor x \rfloor, ⌈x⌉\lceil x \rceil floor, ceiling
x≫kx \gg k, x≪kx \ll k shift right / left by kk bits
x⊕yx \oplus y bitwise exclusive or
msb⁡(x)\msb(x) index of the most significant set bit (msb⁡(0)=−1\msb(0) = -1)
lowbit⁡(i)\lowbit(i) i&(−i)i \mathbin{\&} (-i), the lowest set bit
ν(w)=int⁡(1w)\nu(w) = \operatorname{int}(1w) the heap numeration of a binary address
O,Ω,Θ,o,ω\Oh, \Omega, \Theta, o, \omega asymptotic notation; the growing parameters are always named
∣x∣1|x|_1 L1L_1 norm ∑i∣xi∣\sum_i \lvert x_i \rvert

A.3 Cost conventions

Costs are counted elementary steps in categories read, write, compare, arith, pointer, hash, probe, alloc, edge, rule. An arithmetic operation on a bb-bit integer costs ⌈b/64⌉\lceil b / 64 \rceil steps. The unit cost model weighs every category by one; other models are stated where used. A cost profile is (Tbuild,S,Tquery,Tupdate,∣out∣)(T_{\mathrm{build}}, S, T_{\mathrm{query}}, T_{\mathrm{update}}, \lvert\mathrm{out}\rvert).

A.4 Evidence labels

Proved here · Established · Adapted · Empirical · Conjecture · Rejected · Definition · Proposed — see §§1.8. Ledger identifiers: CGT-DEF definition, CGT-THM/PROP/COR results, CGT-CONJ conjectures, CGT-OBS observations, CGT-EXP experiments, CGT-NEG/REJ negative results, CGT-OPEN open problems, CGT-D decisions, CGT-H hypotheses.

Report an erratum or an unclear passage in this appendix