A Quantitative Definition of Intelligence

arXiv cs.LG / 4/29/2026

💬 OpinionIdeas & Deep AnalysisModels & Research

Key Points

  • The paper introduces an operational, quantitative definition of intelligence for arbitrary physical systems based on “intelligence density,” measured as the ratio of independent outputs’ information to total description length.
  • It distinguishes memorization, knowledge, and knowing a domain by examining how description length scales (growing with outputs vs. staying fixed) and by requiring a single finite mechanism that generalizes across unbounded inputs.
  • The authors argue that “meaning” over a domain corresponds to selecting and ordering functions that yield correct outputs when correctness can be specified.
  • They propose a measure of an output’s contextuality using the inverse of conditional Kolmogorov complexity given prior outputs, aiming to unify notions of correctness and independence.
  • The framework is claimed to refute Searle’s third premise that syntax alone is insufficient for semantics, as long as correctness is specifiable over the relevant domain.

Abstract

We propose an operational, quantitative definition of intelligence for arbitrary physical systems. The intelligence density of a system is the ratio of the logarithm of its independent outputs to its total description length. A system memorizes if its description length grows with its output count; it knows if its description length remains fixed while its output count diverges. The criterion for knowing is generalization. A system knows its domain if a single finite mechanism can produce correct outputs across an unbounded range of inputs, rather than storing each answer individually. The definition places intelligence on a substrate-independent continuum from logic gates to brains. We then argue that meaning over a domain is a selection and ordering of functions that produces correct outputs where correctness is specifiable. We also define a measure of contextuality of an output as the inverse of its conditional Kolmogorov complexity given the context of prior outputs, which unifies correctness and independence into a single condition. Together, these refute Searle's third premise, that syntax is insufficient for semantics, over any domain where correctness is specifiable.