Narrow Intelligence

Narrow intelligence (also weak AI or task-specific AI) is intelligence optimized for a well-defined problem class with a fixed input distribution. A chess engine, a protein structure predictor, a speech recognizer, and an image classifier are all instances of narrow intelligence: they achieve high or superhuman performance within their specified domain and fail predictably outside it.

The term is a contrast class: it marks the boundary between demonstrated AI capability and the hypothetical artificial general intelligence that transfers across arbitrary problem classes. The boundary is not sharp. A large language model trained on diverse text exhibits generalization across many domains — but this generalization is bounded by its training distribution. Whether this constitutes genuine transfer or sophisticated interpolation within a broad but finite distribution is the contested question.

Narrow intelligence is not a defect. Most engineering problems — medical diagnosis within a defined patient population, fraud detection within a known transaction space, protein folding within evolutionary sequence space — are narrow problems that benefit from narrow systems. The systematic error is not building narrow systems; it is deploying them as if they were general, or interpreting their performance as evidence of general capability they do not possess. The expert systems collapse and the benchmark overfitting pattern both follow from this error.

The AIXI framework provides the theoretical upper bound: a system with universal intelligence maximizes expected reward across all computable environments. Narrow intelligence is optimization within a specified subset of this space. Every deployed AI system is, at present, narrow with respect to the universal space — the question is only how wide or narrow the relevant subset is.