Appendices
Appendix A
Notation and Conventions
Definition
A.1 Sets, relations, words
| Notation | Meaning |
|---|---|
| (or where stated) | |
| , , | an alphabet of moves; all finite words over it; the empty word |
| length of a word | |
| projection of onto the letters in | |
| relational composition: first , then | |
| the relations on | |
| , , | meaning of a move, a word, a language (Definition Definition 6.1) |
| is undefined at | |
| domain of a partial map | |
| an admissibility language | |
| a deterministic automaton with partial ; its number of states | |
| a computational structure | |
| an operational grammar (Definition Definition 7.1) |
A.2 Numbers, bits, asymptotics
| Notation | Meaning |
|---|---|
| (in cost statements) | the machine word size in bits; context distinguishes it from a word |
| , | floor, ceiling |
| , | shift right / left by bits |
| bitwise exclusive or | |
| index of the most significant set bit () | |
| , the lowest set bit | |
| the heap numeration of a binary address | |
| asymptotic notation; the growing parameters are always named | |
| norm |
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 -bit integer costs steps. The unit cost model weighs every category by one; other models are stated where used. A cost profile is .
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.