liveBook · Manning

Complicated problem

As explained in The Coder Cafe

A complicated system is an intricate system whose behavior and solutions are sufficiently predictable and repeatable for structured approaches to work.

A complicated problem is intricate but predictable enough for a structured, repeatable solution. Difficulty alone does not make a problem complex: the distinction is whether established methods remain useful or the situation calls for a novel, adaptive approach. section 6.14

Finding a nearby driver

Matching a passenger with the nearest driver is technically challenging, but existing approaches such as geo-hashing offer a way to solve it. Filing taxes is another example: the work can be intricate, while the process remains largely conventional from year to year. section 6.14

Classify the problem before choosing an approach. Reuse a structured solution where the relevant behavior is predictable; do not assume it will work unchanged when challenges demand new approaches. A system may contain both kinds of work, so assess its parts rather than assigning one label to the whole system. section 6.14 section 6.14.2

How The Coder Cafe covers it

How deep it goes
Defines the distinction through contrasts and examples, without implementing the cited technical solution.
Examples
Uses tax filing and nearest-driver matching as complicated cases, contrasting them with climate mitigation and large-scale ML infrastructure.
What you can do after
Evaluate/understand when a structured solution is sufficient and when part of a system calls for adaptation.
How it connects
Contrasts complex systems and connects the distinction to geo-hashing and distributed systems.

Also explained in

Compare how 2 books explain complicated problem →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of The Coder Cafe. The section links point to the parts of the book it draws on.