Field
Foundational results in logic, game theory, and the structures that formalise reasoning and strategy.
Computer Science & AI
Dijkstra's three-page note introduced two classic graph algorithms, including the shortest-path algorithm that now bears his name. It finds the minimum-cost route from a source to all other nodes in a weighted graph.
Nash's one-page note proved that every finite game with any number of players has at least one equilibrium — a set of strategies where no player can do better by unilaterally changing. The 'Nash equilibrium' became the central solution concept of game theory.
Computer Science & AI
Shannon founded information theory. He defined information quantitatively in terms of entropy, introduced the 'bit', and proved fundamental limits on how much data a noisy channel can carry — and that error-free communication is possible up to that limit.
Computer Science & AI
Turing introduced an abstract machine — now called the Turing machine — to make 'computation' precise. He used it to prove that some problems are undecidable, settling Hilbert's Entscheidungsproblem in the negative and founding the theory of computation. (Read in 1936; published in the 1937 volume.)