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-enough

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 enough.

A combinatorial argument that good sequences are astronomically rare, emphasizing the difficulty of discovery.

Neighborhood — ranked by edge-count

Concepts (1)

concept
  • Mathematical 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 edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.