TAI 100Founding course, 2026

Theoretical Artificial Intelligence

The mathematical, computational and experimental study of intelligence: how it emerges, how it operates, how it adapts, and where its limits lie.

14 weeksSix partsLectures, seminars and laboratoriesCharter v0.1, October 2026
1 · Course home

Course description

What the course studies, the question that organises it, and how it is taught.

1.1Overview

This course studies intelligence as a scientific problem. Students learn the mathematical, computational and experimental tools needed to understand existing theories of intelligence, then use them to build, test and revise theories of their own.

It draws on mathematics, probability and statistics, information theory, theoretical computer science, machine learning, cognitive science and control theory, treating each as a source of concepts and methods for one shared problem. It does not assume that intelligence has one universal mechanism, that every intelligent system follows identical laws, or that one number captures every important aspect of intelligence. Those are questions for investigation.

1.2The central question

What general principles govern the emergence, operation, adaptation and limits of intelligence?

The question is approached at four connected levels, which recur in every part of the course.

Mechanism
How a system learns, represents, remembers, predicts, decides and adapts.
Theory
Which mathematical structures explain those mechanisms, and when they fail.
Generalisation
Whether principles found in one system hold in systems with different architectures, resources and substrates.
Measurement
How capabilities can be quantified, separated and compared reproducibly.

1.3An example of the method

Figure 1 shows the kind of formal idea the course examines. It is a toy version of the consequential-equivalence relation, equation (1) in §7.2: two histories are treated as the same when no available action leads to outcomes that differ by more than a tolerance ε.

– classes of 32 histories · – bits
Figure 1. Each point is a history h, placed by the probability of the outcome under policy π₁ (horizontal) and π₂ (vertical). Histories within ε of each other under every available policy share a colour and are merged; grey points remain distinct. Removing π₂ makes vertical differences irrelevant. Synthetic data; merging uses the transitive closure of the ε-relation.

1.4Foundational questions

The course is organised around eight connected questions. They guide teaching and research; they are not a claim that intelligence reduces to a settled list of components.

Q1Definition
What is intelligence? Which observable capabilities warrant the word, and can they be defined in ways that support measurement?
Q2Representation
When should a system preserve a distinction, and when should it merge categories?
Q3Memory
What must be retained, when does more memory help, and when does forgetting become necessary?
Q4Learning
Why do some procedures generalise while others memorise, and why can experience make a system worse?
Q5Consequences
How do prediction accuracy, understanding of mechanism and decision quality relate?
Q6Adaptation
Which properties of an environment set the balance between retaining, updating and exploring?
Q7Limits
How do time, memory, computation, energy and evidence shape what a system can become?
Q8Measurement
Which measurements stay meaningful across architectures and budgets, and is one score ever enough?

1.5Course information

Course number
TAI 100
Offered
Founding course, 2026 (14 weeks)
Format
Lectures, reading seminars, laboratories and a research seminar
Assessment
Problem sets, laboratories, theory reconstructions and a preregistered research project (§2.4)
Governing document
Founding charter, version 0.1, October 2026 (§8)