claim
active
claim:for-a-given-task-the-number-of-all-sequences-which-work-is-tiny-by-comparison-with-the-huge-number-of-all-possible-sequences-less-than-a-trillionth-of-all-6-10-23-possible-sequences-actually-work-well-enoughFor a given task, the number of all sequences which work is tiny by comparison with the huge number of all possible sequences; less than a trillionth of all 6 × 10^23 possible sequences actually work well enough.
A combinatorial argument that good sequences are astronomically rare, emphasizing the difficulty of discovery.
Neighborhood — ranked by edge-count
Concepts (1)
concept
- Partial Order of StepssupportsMathematical representation of precedence relations among steps: which centers must be in position before another can be formed, defining good sequences as linearizations that minimize backtracking.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Alexander's striking quantification of the rarity of good sequences, underscoring why finding the right order is so difficult and precious.
- Highlights the emergent power of even a small network of interlinked sequences.
- Selective pressure toward convergence via task generality
- Feature presence depends on concept frequency in training data, with a threshold scaling inversely with alive features.
- Grounds the subjective speed dimension of super-beneficiary status
- Quantitative estimate of the scope of the gene pool needed for a living world.