STRUCTURED COURSE · 14 LESSONS · 5 PARTS
Computer Science
Follow how logical rules become instructions a machine can carry out.
No completed checks on this device yet.
Begin Statement →Starting level and learning objectives
Start with Statement. Its explanation and recognition check are included in the opening part.
Begin with the first authored foundations. If you enter later, each lesson names its necessary preparation and offers authored recovery.
- Computation is the general process of following an algorithm to transform information — what a computer does is one physical implementation of a much older, more general idea.
- You can relate data-structure trade-offs to the complete operation being performed.
- You can use a growth rate without mistaking it for an exact runtime guarantee.
- You can distinguish a universal impossibility result from the analysis of a particular program.
- A lost reply does not establish that a remote operation failed.
Your route through the course
Open a part to see its purpose and lessons. Begin with the recommended step above; use the curriculum to find your place.
01Inference and computation
Follow how logical rules become instructions a machine can carry out.
- StatementOpen lesson
- ValidityOpen lesson
- InferenceOpen lesson
- AlgorithmsMember lesson
- ComputationMember lesson
02Representing and searching
Examine how data structures change the work required.
- A representation changes the searchMember lesson
- A data structure makes some operations cheapMember lesson
03Correctness and complexity
Separate the answer an algorithm gives from the resources it needs.
- An invariant explains why a loop worksMember lesson
- Complexity describes scaling, not a stopwatch readingMember lesson
04Systems and limits
Reason about concurrency and problems no general algorithm can decide.
- An interleaving can change the resultMember lesson
- No universal procedure decides every program’s terminationMember lesson
05Programs and dependable systems
Run a bounded program, inspect its invariant, and reason about database and network failures.
- Write and inspect a running programMember lesson
- An update that must happen onceMember lesson
- A timeout is not proof of no actionMember lesson
About the course and the three open introductions
Not programming first — computation, information and what can and cannot be computed at all, starting from the same logical foundation this House already built.
Statement
“Close the door” cannot be true or false; it is an instruction. “The door is closed” can be one or the other. Logic only operates on sentences of this second kind.
This sounds trivial until it is skipped: arguments quietly go wrong when a command or a value judgment is treated as if it were a plain factual claim that could simply be true or false.
Validity
“All cats can fly. Felix is a cat. So Felix can fly” is a valid argument: the conclusion follows necessarily from the premises. It is also unsound, because the first premise is false.
Keeping these apart matters. An argument can be perfectly valid and still worthless if it starts from a false premise, and a true conclusion can still come from an invalid argument by accident.
Inference
“If it rains, the ground gets wet. It is raining. So the ground is wet” follows this exact pattern, called modus ponens. The pattern is what guarantees the move, not the specific content about rain.
The same abstract pattern works for any P and Q whatsoever. Recognizing the underlying rule, separate from the particular sentences filling it, is what lets someone check an argument's structure quickly.