Systems & Complexity
Team Learning
Peter Senge's discipline where the intelligence of the team exceeds the intelligence of any individual through aligned, skillful conversation
Systems ThinkingThe encyclopedia
People, books, and breakthrough ideas—connected to the mental models and moves you can use.
Find a mental model
Systems & Complexity
Technical Flywheel
The compounding effect where each technical improvement makes the next improvement easier—better tools enable better tools, better data enables better models, better infrastructure enables faster iteration
Systems ThinkingSystems & Complexity
Unintended Consequences
The outcomes of an action that were not anticipated by the actor—which can be positive (serendipity), negative (backfire), or perverse (the opposite of what was intended)
Systems ThinkingSystems & Complexity
Wicked Problems vs Tame Problems
Horst Rittel's distinction between tame problems (well-defined, with known solutions—like chess) and wicked problems (incomplete definitions, contradictory constraints, no stopping rule, and no 'correct' solution—like po…
Systems ThinkingTechnology & Computing
Algorithms
Step-by-step procedures for solving specific classes of problems or performing computations—the fundamental building blocks of computer science and, more broadly, of any SYSTEMATIC approach to problem-solving
Algorithms & SoftwareTechnology & Computing
Amara's Law (Overestimate Short-Term, Underestimate Long-Term)
Roy Amara's observation that people tend to overestimate the impact of a new technology in the short run and underestimate it in the long run
Algorithms & SoftwareTechnology & Computing
Backup Systems/Redundancy
The engineering principle of building duplicate capabilities so that failure of one component doesn't cause system failure—having more capacity than the minimum needed for normal operations
Algorithms & SoftwareTechnology & Computing
Binary Search
An algorithm that finds a target in a sorted dataset by repeatedly halving the search space—checking the middle element and eliminating the irrelevant half
Algorithms & SoftwareTechnology & Computing
Black box
A system or component whose internal workings are unknown or irrelevant—defined entirely by its inputs and outputs
Algorithms & SoftwareTechnology & Computing
Brooks's Law
Fred Brooks's principle (from The Mythical Man-Month) that 'adding manpower to a late software project makes it later.' New team members require onboarding from existing members (consuming productive capacity), communica…
Algorithms & SoftwareTechnology & Computing
Caching (LRU Cache)
A computing strategy that stores frequently or recently accessed data closer to where it's needed, dramatically reducing retrieval time at the cost of storage space
Algorithms & SoftwareTechnology & Computing
Clarke’s Third Law
Arthur C
Algorithms & SoftwareTechnology & Computing
Computational Kindness
The design principle of reducing the cognitive burden on others in your communications and interfaces—making it easy for people to respond, decide, and act by doing the computational work for them
Algorithms & SoftwareTechnology & Computing
Conway's Law
Melvin Conway's observation that organizations design systems that mirror their communication structures
Algorithms & SoftwareTechnology & Computing
Design Pattern
A reusable solution to a commonly occurring problem in a specific context—originally from architecture (Christopher Alexander) and famously applied to software (Gang of Four)
Algorithms & SoftwareTechnology & Computing
Divide and Conquer
An algorithm design paradigm that solves large problems by recursively breaking them into smaller, more manageable subproblems, solving each independently, then combining the solutions
Algorithms & SoftwareTechnology & Computing
Explore/Exploit Tradeoff
The fundamental tension between exploiting what you already know works (refinement, optimization, execution) and exploring new possibilities (experimentation, innovation, learning)
Algorithms & SoftwareTechnology & Computing
Gall's Law (Working Complex Systems Evolve from Simple Ones)
John Gall's principle that complex systems that work invariably evolved from simple systems that worked
Algorithms & SoftwareTechnology & Computing
Hofstadter's Law
Douglas Hofstadter's recursive observation: 'It always takes longer than you expect, even when you take into account Hofstadter's Law.' The recursive structure is the key insight—even when you know you're bad at estimati…
Algorithms & SoftwareTechnology & Computing
Interrupt Coalescing
A computing technique where, instead of processing every interrupt (notification, request, signal) immediately as it arrives, the system batches multiple interrupts and processes them together at scheduled intervals
Algorithms & SoftwareTechnology & Computing
Lagrangian Relaxation
An advanced mathematical optimization technique that handles hard constraints by moving them into the objective function with penalty weights—converting a constrained optimization problem into an easier unconstrained one
Algorithms & SoftwareTechnology & Computing
Margin of Safety
Benjamin Graham's engineering-inspired principle: build in a BUFFER between what you expect and what you can withstand—so that when reality deviates from expectation (as it always does), the system survives
Algorithms & SoftwareTechnology & Computing
Metcalfe's Law (Extended: Value of Networks)
The foundational network economics principle that the value of a telecommunications network is proportional to the square of the number of its users
Algorithms & SoftwareTechnology & Computing
Metcalfe’s Law
The foundational network economics principle that the value of a telecommunications network is proportional to the square of the number of its users
Algorithms & SoftwareTechnology & Computing
Moore's Law
Gordon Moore's 1965 observation that the number of transistors on a microchip doubles approximately every two years, producing exponential growth in computing power at declining cost
Algorithms & SoftwareTechnology & Computing
Multi-Armed Bandit Problem
The classic explore-exploit problem: you face multiple slot machines ('arms') with unknown payoff rates
Algorithms & SoftwareTechnology & Computing
Network Effects
The phenomenon where a product or service becomes MORE VALUABLE as MORE PEOPLE use it—a positive feedback loop where each additional user increases value for all existing users
Algorithms & SoftwareTechnology & Computing
Optimal Stopping (37% Rule / Secretary Problem)
The mathematical solution to the problem of when to stop searching and commit: examine 37% of your options without committing (the 'exploration' phase), then commit to the next option that's better than anything you saw…
Algorithms & SoftwareTechnology & Computing
Paradox of Automation
The phenomenon where the more reliable an automated system becomes, the more catastrophic its failures are—because human operators lose the skill and attention needed to intervene when automation fails
Algorithms & SoftwareTechnology & Computing
Price of Anarchy
A game theory concept measuring how much worse a system performs when individuals optimize for themselves versus when a central coordinator optimizes for everyone
Algorithms & SoftwareTechnology & Computing
Randomized Algorithms (Monte Carlo Method)
Algorithms that use random sampling to solve problems that are too complex for exact solutions—generating approximate answers by running many random trials and aggregating the results
Algorithms & SoftwareTechnology & Computing
Reed's Law (Value of Group-Forming Networks)
David Reed's extension of Metcalfe's Law: while Metcalfe's Law says network value grows as n² (the number of possible connections between pairs), Reed's Law says the value of group-forming networks grows as 2ⁿ (the numbe…
Algorithms & SoftwareTechnology & Computing
Regularization (Cross-Validation)
A set of techniques in machine learning that prevent models from overfitting—memorizing noise in the training data rather than learning the underlying pattern
Algorithms & SoftwareTechnology & Computing
Relaxation (Solving Easier Versions of Hard Problems)
A mathematical optimization technique where you solve a simplified ('relaxed') version of a hard problem by removing constraints, then use that solution to guide the solution of the original problem
Algorithms & SoftwareTechnology & Computing
Scheduling Theory (Earliest Due Date, Weighted Shortest Job First)
The mathematical study of optimal task sequencing under different objectives
Algorithms & SoftwareTechnology & Computing
Simulated Annealing
An optimization algorithm inspired by metallurgical annealing—heating metal then slowly cooling it to reduce defects
Algorithms & SoftwareTechnology & Computing
Sorting Theory (When to Sort, When Not To)
The computational insight that sorting data has a cost (time, energy) and a benefit (faster subsequent lookups), and the optimal strategy depends on how many times you'll search versus how many items you have
Algorithms & SoftwareTechnology & Computing
Technical Debt
The implied cost of additional rework caused by choosing an easy (limited) solution now instead of using a better approach that would take longer
Algorithms & SoftwareTechnology & Computing
Thrashing (Over-Scheduling)
A computing term for when a system spends more time switching between tasks than doing actual work—the processor is 'busy' but producing nothing because context-switching overhead consumes all available capacity
Algorithms & SoftwareTechnology & Computing
Upper Confidence Bound
An algorithm for the explore-exploit dilemma that balances choosing the best-known option (exploit) with trying uncertain options that might be better (explore)
Algorithms & SoftwareTechnology & Computing
Zawinski’s Law
Jamie Zawinski's observation that 'every program attempts to expand until it can read mail
Algorithms & SoftwareTool Adoption & Technology
Integration Depth Spectrum (Shallow Use → Deep Mastery)
The framework for understanding that tool adoption exists on a spectrum from shallow use (surface-level features, default settings, basic functions) to deep mastery (advanced features, workflow integration, customization…
Adoption & EvaluationTool Adoption & Technology
Switching Cost Analysis (Total Cost of Tool Change)
The comprehensive framework for evaluating the true total cost of changing tools, technologies, or systems—encompassing not just the visible costs (license fees, purchase price) but the hidden costs that typically domina…
Adoption & EvaluationTool Adoption & Technology
Tool Audit Protocol (Regular Evaluation Cadence)
A systematic practice of regularly evaluating which tools, systems, and processes you use against which ones you should be using—killing tools that no longer serve, adopting tools that would improve effectiveness, and re…
Adoption & EvaluationTool Adoption & Technology
Tool Lifecycle Management (Adopt, Adapt, Abandon)
The framework for managing tools through their natural lifecycle: adoption (evaluating and onboarding), adaptation (customizing and integrating into workflows), and abandonment (recognizing when a tool has been supersede…
Adoption & EvaluationTool Adoption & Technology
Tool-Task Fit (Matching Tool Capability to Actual Need)
The principle that tool selection should be driven by the specific task requirements rather than by tool sophistication, popularity, or personal familiarity—matching the CAPABILITY of the tool to the ACTUAL NEED of the t…
Adoption & EvaluationTool Adoption & Technology
Minimum Effective Tool Stack
The principle that the optimal set of tools is the smallest set that covers all essential functions—minimizing the overhead of tool management, switching costs, integration complexity, and learning curves while maintaini…
Tool StrategyTool Adoption & Technology
Single Source of Truth Principle
The data architecture principle that every piece of critical information should have exactly one authoritative source, with all other references pointing back to it
Tool StrategyPage 25 of 50 · 1153–1200 of 2,375 models