liveBook · Manning

Essential complexity

Essential complexity is the unavoidable difficulty inherent in a problem’s domain, rules, and required outcomes, which cannot be removed without sacrificing necessary behavior.

How 2 Manning books explain it

Collaborative Software Design: How to facilitate domain modeling decisions

Essential complexity is the irreducible complexity inherent in the problem domain that software design can manage but not eliminate.

How it is used
Guides bounded-context decisions by balancing local simplicity against communication complexity across boundaries.
How deep it goes
Explains the design trade-off and recommends modeling communication, but stops short of prescribing a complexity metric.
Examples
Uses alternative bounded-context designs and a group's concern about communication between split contexts.
What you can do after
Apply it via domain message flow modeling to compare boundary designs before implementation.

Read how Collaborative Software Design: How to facilitate domain modeling decisions explains essential complexity →

Functional Design and Architecture: Examples in Haskell

Complexity inherent in the problem domain that cannot be removed without failing to support required behavior.

How it is used
Frames software design around distinguishing unavoidable domain demands from complexity introduced by implementation choices.
How deep it goes
Defines unavoidable complexity and illustrates it through architecture, then stops before measuring or formally decomposing complexity.
Examples
Uses spaceship redundancy, recovery codes, subsystem commands, and differing booster and rotary-engine APIs.
What you can do after
Evaluate/understand which complexity required behavior imposes and which abstraction choices can keep implementation concerns manageable.

Read how Functional Design and Architecture: Examples in Haskell explains essential complexity →

Also covered in

Related concepts

Questions about essential complexity

What is essential complexity?

Essential complexity is the unavoidable difficulty inherent in a problem’s domain, rules, and required outcomes, which cannot be removed without sacrificing necessary behavior.

Which Manning books explain essential complexity?

Collaborative Software Design: How to facilitate domain modeling decisions and Functional Design and Architecture: Examples in Haskell.

What is the difference between essential complexity and accidental complexity?

Essential complexity is the unavoidable difficulty inherent in a problem’s domain, rules, and required outcomes, which cannot be removed without sacrificing necessary behavior. Accidental complexity is difficulty arising from implementation choices or technical constraints rather than from the essential requirements of the problem being solved.

What is essential complexity a kind of?

Essential complexity is a kind of complexity. Complexity is the degree to which interacting elements or factors make a system or problem difficult to understand, predict, change, operate, or solve.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.