Algorithmic Procedures & Discrete Processes

← Back to Domain-Specific Families

Abstractions about general-purpose algorithms, randomized procedures, cumulative processes, sorting, self-organization, combinatorial games, and discrete process models.

14 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Equivalence number method — Allocate a shared cost pool across related outputs by converting their quantities into weighted equivalent units relative to a reference product and preserving the total allocated cost.
• Hybrid algorithm — An algorithmic design that combines two or more methods for the same problem and selects or switches among them to exploit complementary performance regimes.
• Maze generation algorithm — An algorithm that constructs a maze by selecting passages in a cell-adjacency graph, usually enforcing connectivity and optionally uniqueness of paths, loops or stylistic constraints.
• Multi-trials technique — A distributed symmetry-breaking technique in which each node tests an increasing batch of randomized choices per communication round to reduce round complexity.
• Petri net — A bipartite place-transition graph with a token marking whose enabled transition firings consume and produce tokens, modeling concurrency, synchronization and resource flow in discrete-event systems.
• Problem of Points — Divide the stake of an interrupted race-to-a-target game by each player's conditional probability of eventually winning, computed from the current score and the agreed continuation model rather than from points already accumulated.
• Racetrack problem — A cyclic race-condition flaw in which signals or events repeatedly chase one another around a feedback path, making the result depend critically on relative timing.
• Random seed — The initial state value supplied to a pseudorandom generator so that it deterministically produces a reproducible sequence.
• Running total — A cumulative sum updated incrementally by adding each new observation to the previous total, yielding every prefix sum without recomputing the full sequence.
• Self-organizing map — Train prototype vectors arranged on a low-dimensional lattice by repeatedly moving a best-matching unit and its lattice neighbors toward input samples, producing a topology-oriented representation of high-dimensional data.
• Toothpick sequence — Count the total line segments in a deterministic planar growth process that starts from one segment and at each stage adds a perpendicular segment at every exposed endpoint.
• Tournament sort — A comparison-sorting algorithm that organizes elements in a tournament tree, repeatedly outputs the winner and updates only the path affected by its replacement.
• UCI race classifications — The Union Cycliste Internationale code system classifying cycling events by discipline, format and competitive level to govern calendar status, participation and ranking points.
• Urn problem — A probability model representing random sampling from a finite population by drawing colored or labeled balls with a specified replacement and reinforcement rule.