Information Technology & Networks¶

27 domain-specific abstractions whose origin domain is Information Technology & Networks.

Battle of the Sexes — A 2×2 game in which both players prefer coordinating on some common outcome to failing, but each prefers a different one — so the conflict is not whether to cooperate but which of two cooperative agreements is reached, a distributional fight the payoff matrix cannot settle.
Citation Pointer — A structured reference that identifies a source well enough to locate and verify it — an identification-plus-resolution bridge from claim to artifact that builds the infrastructure for verifiability without asserting the support is adequate, so 'has a citation' and 'is well-supported' stay separate findings.
Cooper's Law — The empirical trajectory by which the number of simultaneous radio conversations supportable in a given spectrum at a given location has doubled roughly every 30 months for a century, driven chiefly by spatial reuse — so capacity is grown by densification, not by acquiring bandwidth.
Feature scaling — The preprocessing step that rescales numerical inputs to a common range so no variable's unit of measurement silently dominates a scale-sensitive method — making the choice of weighting an explicit analytical commitment rather than an accident of source units.
Filter bubble — The algorithmic narrowing of a user's information exposure when a recommender optimizes for short-term engagement on revealed preference — a self-reinforcing feedback loop that no user chose and no user effort can dissolve, correctable only in the ranking pipeline.
Format Relation — Bind a resource to the encoding it is materialized in as an explicit, queryable metadata field drawn from a controlled registry, so rendering, routing, and preservation read off the recorded format rather than re-parsing the bytes.
Hartley's Law — Fix the maximum information a noiseless bandwidth-limited channel can carry as H = 2WT·log₂(M) — the product of a linear sample-rate factor (bandwidth) and a logarithmic resolution factor (distinguishable signal levels).
Koomey's law — The empirical trajectory by which computations delivered per joule dissipated have doubled about every 1.57 years (slowing to ~2.6 after Dennard scaling broke in 2005), tracking the energy cost of a logical operation toward the Landauer floor.
Kranzberg's first law — Technology is neither good nor bad, nor is it neutral: an artifact's valence is not fixed by its properties, but neither is it zero, because by reshaping what is cheap, easy, or possible it takes a context-indexed position even when no actor intends it to.
Lehman's law of conservation of familiarity — Hold the mean change shipped per release of a long-lived software system roughly constant, because the producer and consumer communities have a bounded capacity to absorb novelty, and overdrawing it forces a corrective contraction.
Lehman's law of conservation of organizational stability — Observe that a long-lived software organization's long-run work rate returns to a band set by structural parameters no matter how you push the local dials — staffing, hours, pressure — so durable throughput gains require restructuring, not loading.
Lehman's law of continuing change — The empirical software-evolution law that an E-type system — one embedded in a moving real-world environment — must be continually adapted or it progressively becomes less satisfactory, because its fitness is relational (the gap between what the code does and what the world now requires) and that gap widens monotonically while the code stands still.
Lehman's law of continuing growth — State that a long-lived software system must continually expand its functional content to retain users, because satisfaction is judged against a rising competitive reference point — adaptation alone holds fitness constant while rivals grow past it.
Lehman's law of declining quality — Read software quality as the system's fit to its present environment rather than its intrinsic defect count, so an unchanged, bug-free release still degrades in the field as the surrounding world drifts away from the conditions it was built for.
Lehman's law of increasing complexity — Observe that the structural, behavioral, and conceptual complexity of an evolving software system rises monotonically under unmanaged change — an entropy-positive default that only deliberate, non-feature restructuring can bend back down.
Lehman's law of self regulation — Treat a long-lived software project as a closed feedback loop that self-regulates around an operating point, so single-node pushes are absorbed and only structural changes to the loop durably relocate its release-size, cadence, and defect-density distributions.
Linus's Law — Given enough eyeballs, all bugs are shallow: defect discovery scales with the size and diversity of the pool of independent inspectors examining code — provided they are skilled, motivated, and actually reading it, not merely granted access.
Liskov Substitution Principle — Certify that a subtype can safely replace its supertype only when it honours the supertype's full contract toward clients — weakening preconditions, strengthening postconditions, preserving invariants — regardless of taxonomy or compilability.
Method-as-Metadata — The cataloging move of recording how a resource was produced or what procedure it employs as a first-class, controlled-vocabulary field — orthogonal to topic, creator, date, and form — so a corpus becomes filterable by technique without reading each item.
Mooers's law — The retrieval-system regularity that a system tends not to be used whenever having the information is more troublesome than not having it — adoption governed by the per-query cost-benefit ratio against a substitute, not the content's absolute value.
Moore's law — The empirical observation that transistor count per economically optimal integrated circuit doubles roughly every two years — a self-fulfilling industry roadmap that coordinated investment across the semiconductor supply chain so the complementary inputs for each process node arrived together.
Navigation loop — Diagnose a workflow where a user cannot reach their goal by modeling the interface as a directed graph and asking one structural question — is any goal state reachable from the current state? — rather than blaming screen quality or user confusion.
Onboarding cliff — Diagnose first-use abandonment as a geometry of two curves — cumulative cost crossing the user's willingness-to-invest before cumulative value crosses willingness-to-stay — separating first-contact complexity from steady-state complexity and naming exactly two levers.
Postel's Law (Robustness Principle) — Postel's protocol-design maxim — be conservative in what you send, liberal in what you accept — which keeps a multi-vendor system interoperable by having every implementation produce tightly to spec while its acceptance window absorbs the realistic scatter of others.
Publisher Relation — Collapse a long chain of authorship, review, and production into one resolvable metadata handle naming the agent who effected a resource's release, so every downstream governance question routes to the same addressable accountable party.
Replacement Relation — Record that a distinct successor resource takes over a predecessor's canonical standing and flags it obsolete, as a bidirectional machine-routable link, so consumers read currency off the chain rather than inspecting the artifacts themselves.
Shannon–Hartley Theorem — Compute a noisy channel's maximum error-free bit rate as C = B·log₂(1 + S/N), a bound that is at once a wall no code can beat and a target codes can approach, linear in bandwidth but only logarithmic in signal-to-noise.