Self-check in your browser
Each unit carries its own checkpoints at the foot of its page, with diagnostic feedback. Your progress page collects all of them, and what you have recorded so far, in one place. Nothing to install, nothing uploaded.
A self-study sequence about ordered algorithms, language-model generation, and why human verification matters. Work through the units in order; check yourself as you go.
Early release, still in testing. Version 0.1.0 is an early release: the course is complete enough to use, and this release is the test. Your comments and error reports are what will shape the next version: send them to gitlab+ai-edu-ai-literacy-ada-verification-232-issue-@qyber.black. Its content may still change.
The program often called the first ever written set out how to compute Bernoulli numbers — a description Unit 2 shows is contested, which is a good place to start. Let's use it to learn how to work with — and check — the newest kind of machine. Note G sets out an exact, ordered procedure; a language model predicts plausible code. Ask the AI to reconstruct Lovelace's computation, then do what her era couldn't do cheaply: verify it. The arc deterministic algorithm → statistical generation → human verification is the whole literacy story in one example.
Two things make this work rather than just read. First, every unit has a checkpoint you can pass or fail — a wrong answer tells you which misconception you have hit. Second, there is a verification lab that judges generated code against an exact reference.
Routes differ in which units they include; the routes page says what each covers and what it leaves out. Pick one and the previous/next links follow it on every page you open from here; turn on local progress to have the choice remembered next time. You can change it here at any time.
The optional progress tools save only in your current browser profile. Browser data can be lost, so keep important answers separately and download regular backups.
Each unit carries its own checkpoints at the foot of its page, with diagnostic feedback. Your progress page collects all of them, and what you have recorded so far, in one place. Nothing to install, nothing uploaded.
Clone the repository and run the verification lab and the same checkpoints locally, using the Python standard library. Nothing to install beyond Python 3.
Nineteen units in six parts. The parts are the shape of the argument, not a schedule -- a route may take units from any of them, and the route you choose decides which ones you meet.
What the course asks of you, and what it does not. One unit, and the rest of the course rests on it.
How to use the course, what AI systems produced, and the learning contract you are agreeing to.
What a generative system is for, where the ordered procedure at the heart of the course comes from, and how to work with a tool whose output you cannot take on trust.
Five classes of task sorted by where the reference lives, and why that -- not the topic -- decides what checking costs.
Lovelace, the Analytical Engine, Note G, and what it takes to specify a computation exactly.
Next-token prediction set against deterministic execution, and why plausibility is not correctness.
Four kinds of system, what each one changes about the checking you owe, and what a query costs in money, time and energy.
What actually reaches the system, why the window has an edge you cannot see, and why an attachment makes an answer checkable rather than true.
The course's spine, worked end to end -- a result you can derive by hand, the same result generated, and the check that decides between them.
Enough mathematics to know what correct output looks like — including the two convention traps that make correct programs disagree.
A deliberately underspecified prompt, and the plausible mistakes it produces.
Run generated code against an exact oracle, find the first divergence, and name the failure mode.
The same method carried to work with no arithmetic in it -- sources, revision, and actions that reach outside the page.
The course's second worked case, run on a question with no oracle -- what a citation establishes, and six named ways one fails.
Turning a vague request into testable requirements. Most clauses are bugs that already happened.
What changes when a system acts rather than answers -- an action can change the world before you have looked at it, so sort by what recovery costs and check the calls rather than the report.
What follows from using these systems on real work -- consequence, data, rights, the people described, and the faults printed in Note G.
A second axis -- how much checking, from consequence, reversibility, your own uncertainty and whether it is yours to decide -- and the row where the answer is another person.
What actually leaves your device, what is retained, and a classification by whose material it is rather than by how secret it feels.
Three obligations owed separately -- rights, attribution and disclosure -- and honesty about which of them has unsettled answers.
The method run on its hardest object -- what one controlled comparison establishes, why absence escapes it, and the part with definite answers.
An error in a respected published table, the difference between an established fact and a repeated claim, and the course's own mistake with both.
What you attach to the work, and where the person checking it stands. The closing argument.
Say why your answer is right, with evidence someone else can check; say how it was made; know which of the two carries the weight.
The closing unit. Where the observer stands when it checks something, why that question is older than AI, and how to sort claims by the evidence actually behind them.
Two videos outside the units, for anyone deciding whether the course is for them or for their students. Neither is part of a route.