Leçons — Collège

A bright, sunlit computer science lab with large windows. A whiteboard displays a clean network graph: six labeled nodes (A–F) connected by arrows, with small clocks on some edges marking "sync" and "async" links. Three students collaborate around a table with laptops showing distributed process timelines. A sticky note reads "Byzantine Fault?" beside a highlighted red node. Color-coded message-passing arrows flow between nodes in blue, green, and orange.

A bright university whiteboard-style illustration in clean daylight. A confident student stands at a large whiteboard divided into three glowing sections labeled "BPP," "Derandomization," and "Pseudorandom." Colorful arrows show random coin-flip symbols transforming into deterministic gears. A funnel labeled "Extractor" converts scattered colorful dots into an orderly stream. Floating small pseudorandom bit sequences "01101" connect to a deterministic algorithm flowchart, all rendered in crisp blues, oranges, and greens on a white background.

A bright, sunlit computer science classroom with a large whiteboard displaying a clean complexity comparison chart. Colorful illustrated data structures line the board: a tidy array of boxes, a linked chain, a balanced binary tree, and a hash table grid. Bold labels show **O(1)**, **O(log n)**, **O(n)** beside each structure's insert/search/delete columns. A friendly professor points enthusiastically at the tree, surrounded by engaged students with open laptops showing matching diagrams.

A bright, sunlit university lab with large windows and clean white walls. A confident student at a modern desk examines a colorful state-transition diagram on a glowing monitor, with labeled nodes connected by arrows marked with logical symbols. A whiteboard displays neat formulas: "LTL: □(p→◇q)" and "CTL: AG(safe)." Nearby, open textbooks show flowcharts of model-checking algorithms. Potted plants and warm afternoon light create an optimistic, focused academic atmosphere.

A bright university lab setting with large windows letting in golden sunlight. A whiteboard displays Shannon's entropy formula **H = -Σ p(x) log₂ p(x)** alongside a clean channel capacity diagram showing signal waves flowing through a labeled "noisy channel" into a decoder. A student sketches a binary decision tree with probability branches 0.5/0.5, while textbooks and a laptop showing clean bit-stream graphs sit on a well-lit desk.

A bright university lecture hall bathed in warm sunlight, a large whiteboard displaying a clean diagram: a curved hypothesis space boundary labeled "VC Dimension" with scattered colorful data points inside and outside the boundary. A confident instructor points to the curve while three engaged students watch. Nearby, a glowing laptop shows a simple neural network graph. Bold annotations read "Low Complexity → Generalize" and "High Complexity → Overfit" with clean arrows connecting them.

A bright university classroom with large windows letting in daylight. A professor stands at a whiteboard divided into labeled columns: "Supervised," "Unsupervised," and "Complexity Class." A clean diagram shows a decision tree branching on the left, an SVM margin illustration with support vectors in the center, and a complexity ladder labeled P → NP → NP-complete on the right. Students at desks take notes, textbooks open, coffee cups nearby.

A bright, sunlit university lab with white walls and large windows. A central whiteboard displays a clean finite automaton diagram — labeled states q0→q1→q2 with arrows marked "a,b" — connected by chalk lines to three illustrated panels: a colorful compiler pipeline with token symbols, a circuit board with highlighted logic gates, and a network diagram with validated packet nodes. A cheerful student points confidently at the state machine diagram.

A bright university study lounge bathed in warm daylight. A large whiteboard displays three labeled portraits side-by-side: "Church," "Turing," "Gödel" with arrows connecting to a central diagram showing a classic Turing machine tape with binary symbols, a lambda expression "λx.x," and an incompleteness boundary line marked "LIMIT." A student points enthusiastically at the boundary, surrounded by open textbooks and coffee cups on a sunny wooden table.

Bright university lecture hall bathed in warm daylight. A large whiteboard displays a clean circuit diagram with labeled quantum gates (H, CNOT, T) and the complexity hierarchy showing P ⊆ BQP ⊆ PSPACE. A glowing blue qubit sphere sits on a sunny lab bench beside classical binary cards (0,1) and a quantum card showing |0⟩+|1⟩. Shor's Algorithm's factoring speedup is illustrated with arrows: 2^512 classical steps shrinking to polynomial quantum steps. Colorful, optimistic, academic atmosphere.

A bright, sunlit university study space with two students at a clean white table. One student (the "prover") holds a sealed envelope labeled "SECRET" while confidently nodding; the other (the "verifier") holds a checkmark card reading "✓ CONVINCED." Between them, a clear diagram shows three labeled pillars: "COMPLETENESS," "SOUNDNESS," "ZERO-KNOWLEDGE" supporting a glowing arch labeled "ZK PROOF." Colorful arrows show information flowing one-way — conviction without revelation.

A bright, sunlit laboratory workspace where three glowing concept zones connect across a clean white surface: coiled DNA double-helix strands labeled "DNA Computing" with tiny path-nodes forming a Hamiltonian graph solution; a simplified neural network diagram with cheerful circular nodes and weighted edges; and a flowchart showing evolutionary algorithm cycles. Bold arrows link all three zones under a header "Biological Computation." Warm daylight streams through tall windows, with colorful molecular models and circuit boards arranged neatly nearby.

A bright university lecture hall scene with two friendly cartoon figures at a sunlit whiteboard: a "PROVER" (holding a glowing document) and a "VERIFIER" (holding a checkmark stamp). Between them, colorful speech-bubble arrows bounce back and forth labeled "challenge" and "response." The whiteboard shows a clean diagram: "IP = PSPACE" with a simple probability meter reading "Pr[accept] ≥ 2/3." Warm natural light fills the room.

Bright university study space with large whiteboard on a sunny wall. A student sketches a parse tree branching downward: root node labeled **S**, splitting into **NP** and **VP**, further branching to terminal leaves. Nearby, a colorful stack diagram shows a pushdown automaton with labeled states and a visible stack containing symbols **a, B, $**. Production rules **A → aB | ε** are written cleanly beside. Books and a laptop sit on a light wooden desk.

A bright, airy university lecture hall bathed in warm daylight, with a large whiteboard displaying a clean categorical diagram: labeled nodes A, B, C connected by curved arrows labeled f, g, and g∘f, clearly illustrating morphism composition. A cheerful professor points enthusiastically at the identity arrow looping on node A. Color-coded sticky notes highlight objects in sky-blue and morphisms in sunny yellow, making abstract structure feel approachable and organized.

A bright university lecture hall scene with large whiteboards covered in clean diagrams. A stylized Turing machine tape runs across the center, with branching arrows splitting into two colorful paths labeled "YES" and "NO" with probability fractions "2/3" and "1/3" beside them. A glowing Venn diagram shows complexity classes P, BPP, and NP as overlapping colored circles. Dice and random variable symbols float playfully alongside neat probability trees, all on a crisp white background with warm amber lighting.

A bright university lecture hall with large windows letting in warm daylight. A professor points to a clean whiteboard showing a number line labeled "OPT" at one end and "APX Solution" marked nearby with a bracket labeled "≤ 2·OPT." Colorful nodes and edges form a cheerful graph diagram beside it. Students lean forward engaged, notebooks open, coffee cups on desks. Bold labels read "NP-Hard," "APX Class," and a simple inequality "ALG ≤ ρ·OPT."

A bright university classroom whiteboard displays a clean tree diagram illustrating hierarchical language parsing: a root node labeled "Sentence" branching into "Noun Phrase" and "Verb Phrase," cascading further into labeled leaf nodes with sample words. Alongside, a simplified neural network diagram shows three labeled layers stacked vertically with connecting arrows. Warm daylight streams through windows, colorful markers scatter across the foreground, and a friendly professor gestures toward the nested syntax structure.

Bright university whiteboard classroom bathed in sunlight. A cheerful illustrated quantum circuit diagram fills the board, showing parallel computation paths branching like colorful tree lanes in blue, yellow, and green. Clear labeled boxes show "Shor's" and "Grover's" algorithms with bold arrows comparing classical O(N) versus quantum O(√N) search speedup. A friendly professor figure points enthusiastically at intersecting complexity class bubbles labeled "BQP" and "P," surrounded by clean geometric qubit symbols.

A bright university-style whiteboard fills a sunny classroom, showing a clean balance scale diagram at center. The left pan holds a glowing clock labeled "TIME" with a fast-running arrow; the right pan holds stacked memory blocks labeled "SPACE." Above, a colorful graph plots quicksort partition steps against memory usage. Complexity class labels "L," "P," "PSPACE" appear in bold colored bubbles along a cheerful horizontal spectrum. Warm daylight streams through tall windows.

A bright, sunlit university lab with white walls and large windows. A cheerful whiteboard displays interconnected colorful circles labeled "MATH," "PHYSICS," "BIOLOGY," "CS," joined by curved arrows forming a vibrant web. A student sketches a quantum circuit diagram beside the formula "BQP ⊆ PSPACE," while floating icons — a DNA helix, atom, graph node, and sine wave — orbit a glowing central hub drawn in warm yellow marker strokes.

A bright university whiteboard filled with clean mathematical diagrams: a traditional Turing machine tape on the left labeled "discrete {0,1}" transitions via a bold arrow to a BSS machine diagram on the right labeled "ℝ-operations," showing numbered real-number registers and branching decision nodes. Below, a coordinate plane illustrates a curved complexity boundary separating regions labeled "P_ℝ" and "NP_ℝ" in vivid blue and orange. Warm daylight floods the classroom.

A bright, sunlit computer science classroom with a large whiteboard showing three clean diagrams side by side: a multi-tape machine with parallel horizontal tapes and labeled read/write heads, a branching tree diagram for non-deterministic paths, and a universal Turing machine accepting a smaller machine as input. Color-coded tape cells in yellow, blue, and green, with clear labels "Multi-Tape," "NTM Branches," and "UTM." Cheerful, optimistic daylight atmosphere.

A bright university classroom whiteboard filled with a clean, colorful diagram showing a nested hierarchy of space complexity classes: a small yellow circle labeled **L**, inside a green circle labeled **NL**, inside a large blue circle labeled **PSPACE**, all on a white background. A cheerful student points to the diagram with a marker. Alongside, a sunny memory tape illustration shows logarithmic tick marks with "log n" labeled clearly above it.

Bright university study space with warm natural light. A large whiteboard displays the Chomsky Hierarchy as four nested rectangles labeled "Regular," "Context-Free," "Context-Sensitive," and "Recursively Enumerable" in clean bold text. A cheerful student points to the diagram beside a finite automaton drawing with labeled states and arrows. An open textbook shows alphabet symbols Σ = {a, b} and sample strings. Potted plants and sunlight complete the scene.

A bright university whiteboard in a sunlit classroom displays two overlapping circles labeled **P** and **NLP** with a bold **"="** and **"≠"** between them marked with a question mark. A focused student sketches a flowchart connecting puzzle pieces labeled **SAT** to a polynomial-time clock icon. Clean colorful arrows show "verify fast → solve fast?" alongside the year **1971**. Warm daylight streams through large windows onto organized desks and open textbooks.

A bright, sunlit computer science classroom with a large whiteboard showing a clean network diagram: five labeled nodes (A, B, C, D, E) connected by arrows representing message passing. A cheerful professor points to a highlighted "PAXOS" consensus flowchart beside it, showing "PROPOSE → PROMISE → ACCEPT" steps in bold colors. Miniature clocks above nodes illustrate synchronization, while a small broken-link icon demonstrates fault tolerance. Warm yellow lighting, crisp blues and greens throughout.

Bright university lab setting, large whiteboard under warm daylight streaming through tall windows. Two colored process timelines — one blue labeled "P1", one orange labeled "P2" — interleave into a single merged sequence shown as alternating colored blocks: P1→P2→P1→P2. A friendly professor points to a synchronization point marked "sync" where both timelines converge. Clean diagrams show CSP notation beside rounded state bubbles connected by arrows, with small locks and handshake icons illustrating coordination between concurrent threads.

Two figures, Alice and Bob, sit at bright white desks on opposite sides of a sunlit classroom, each holding half of a colorful input string labeled "x" and "y." A clean blue channel connects them with numbered message arrows: "m₁→", "←m₂", "m₃→". A central chalkboard shows f(x,y)=? with a communication cost counter reading "bits: 3." Warm daylight fills the scene; a bar chart compares protocol rounds overhead.

A bright university whiteboard in a sunlit classroom displays a clean diagram: a large input block labeled "n" splits into two clear paths — one tagged "parameter k (small, fixed)" glowing in warm yellow, one showing "problem size n (large)." An arc labeled "f(k) · n^c" curves satisfyingly to a green checkmark "FPT!" Colored complexity ladder boxes stack neatly: FPT → W[1] → W[2] in ascending pastel blues. A friendly professor's hand points enthusiastically at the FPT tier.

A bright university lecture hall bathed in warm daylight, a large whiteboard displaying a clean probability distribution curve above a complexity axis labeled "Average-Case vs Worst-Case." A confident professor points to branching decision trees annotated with probability weights (0.3, 0.5, 0.2). Textbooks, a laptop showing Bayesian network diagrams, and coffee cups sit on desks. Students take notes enthusiastically. Bold chalk text reads "Levin's Avg-Case Complexity" in the corner.

A bright, sunlit university lecture hall with a large whiteboard showing a clean diagram: a standard Turing machine tape on the left with an arrow pointing right toward an "Oracle Machine" box receiving a glowing question mark input from above. Beside it, a Zeno machine timeline shrinks geometrically — steps labeled 1, 1/2, 1/4, 1/8 — converging to a finish line. Bold labels read "Super-Turing," colorful arrows connect concepts cheerfully.

A bright university seminar room with large windows letting in daylight. Two friendly illustrated characters — Arthur (in a crown, representing the verifier) and Merlin (in a wizard hat, representing the prover) — sit across a sunlit table exchanging glowing message cards labeled "PROVE IT" and "CHALLENGE." A clean whiteboard behind them shows the complexity chain: **P ⊆ NP ⊆ IP = PSPACE** with colorful arrows. A small padlock icon labeled "ZKP" floats between them, symbolizing zero-knowledge verification without revealing secrets.

A bright university lecture hall with large sunlit windows. A professor points to a clean whiteboard displaying a clear complexity diagram: a Venn-style chart showing labeled bubbles "P," "NP," "BQP" in crisp blue, green, and gold. Nearby, a stylized quantum circuit diagram shows qubits as cheerful labeled nodes. A chalkboard sidebar neatly shows "Shor's: O((log N)³)" beside "Classical: exponential," emphasizing the speed-up contrast with bold arrows.

A bright university lecture room bathed in warm daylight. A large whiteboard displays a colorful diagram: a central glowing certificate labeled "NP Proof" connected by arrows to a small magnifying glass examining just three highlighted bits, illustrating the PCP Theorem. Nearby, two solution bars compare "Optimal" versus "Approximation" with a ratio gap labeled "≤ 1.5×". Books, coffee cups, and eager students surround a professor pointing enthusiastically at the diagram.

A bright university whiteboard filled with colorful chalk diagrams showing two labeled alphabet boxes "Σ" and "Δ" connected by a clean curved arrow labeled "h" in bold orange. Below, string "abc" transforms step-by-step into "aabbcc" with color-coded letter substitutions. A finite automaton diagram sits nearby with labeled states and transition arrows. Sunlit classroom, clean white background, tidy geometric shapes, confident student pointing at the transformation chain.

A bright university lecture hall bathed in warm afternoon sunlight. Two characters labeled "Prover" and "Verifier" sit across a clean white table, exchanging labeled message arrows: "claim," "challenge," "response." A whiteboard behind them shows "IP = PSPACE" in bold blue letters with a simple polynomial-time clock icon. Speech bubbles display back-and-forth dialogue steps numbered 1→2→3, illustrating the interactive protocol rounds clearly.

Bright university classroom setting, large whiteboard filled with clean diagrams showing two labeled boxes: "L (Deterministic)" and "NL (Nondeterministic)" nested inside larger complexity class boxes. A cheerful student sketches a small Turing machine with a tiny read-only input tape and a miniature work tape labeled "O(log n)" in blue marker. Memory bars shrink logarithmically on a sunny yellow graph beside the board, clearly illustrating the compact space advantage.

A bright university-style whiteboard filled with two clean automaton diagrams side by side, labeled "DFA" and "NFA" in bold blue marker. Circular states (q0, q1, q2) connected by crisp arrows show transitions: DFA arrows each carry exactly one letter, while NFA arrows branch into multiple paths from a single state. A double-circle marks accepting states. Warm sunlight streams through a classroom window onto the cheerful, color-coded diagram.

A bright university whiteboard scene bathed in warm daylight. A Turing machine tape stretches across the center with cells labeled 0s and 1s, and a coin flip icon above a fork splitting into two glowing decision paths. A Monte Carlo diagram shows scattered random dots converging toward "π ≈ 3.14" inside a quarter-circle grid. A clean label reads "BPP" inside a bold complexity hierarchy bubble. Chalk arrows connect randomness to efficiency, everything crisp, colorful, and energetic.

Bright university whiteboard scene in a sunlit classroom. A confident student sketches a clear diagram: two bars side by side labeled "OPT" and "ALG," with a clean bracket showing "≤ 2×OPT" approximation ratio. Nearby, a colorful graph of NP-hard nodes connected by highlighted approximate paths glows in daylight. Textbooks labeled "Vazirani" sit stacked on a wooden desk. Clean blue, yellow, and green palette throughout.

Bright university lecture hall, sunlit whiteboard split into two clear columns: left side labeled **"DECIDABLE ✓"** shows a cheerful Turing machine diagram with tape and read-write head, green checkmark output; right side labeled **"UNDECIDABLE ✗"** shows the same machine with a looping arrow and red question mark. Center bottom: a bold boundary line labeled **"LIMITS OF COMPUTATION"**. Clean, vivid primary colors on white background.

A bright university whiteboard-style scene bathed in warm daylight. Three labeled columns glow in soft colors: "Propositional," "Predicate," "Temporal" with clean symbolic examples — P∧Q, ∀x P(x), and □◇φ. A friendly illustrated computer program flowchart connects to checkmark-verified model boxes. Colorful arrows show formal verification paths. Textbooks, a coffee cup, and sticky notes decorate a clean oak desk beneath large sunny windows.

A bright university lecture hall with large sunlit windows. A clean whiteboard displays three labeled diagrams side by side: a DFA state diagram with circles and arrows, a context-free grammar rule "S → aSb | ε", and a simplified Turing machine tape. A professor points enthusiastically at the DFA. Nearby, a laptop screen shows a compiler pipeline flowchart. Students take notes with colorful pens, textbooks open on desks.

Bright university lecture hall bathed in afternoon sunlight. A large whiteboard displays a clean diagram: a dotted hypothesis boundary curve separating labeled blue circles and orange triangles, with the annotation "ε-error bound" and sample size formula "m ≥ 1/ε·log(d/δ)". A cheerful professor gestures toward a VC-dimension illustration showing four shattered points. Students take notes, surrounded by open textbooks, coffee cups, and geometric doodles on graph paper.

A bright university study room with large sunny windows. A focused student at a clean white desk examines two printed strings: one long random binary sequence "10110100111010..." beside a short compressed program code "p = 001101" with an arrow labeled "U(p) = x" pointing to the long string. A whiteboard behind shows the formula **K(x) = min{|p| : U(p) = x}** in bold marker, with a small friendly robot labeled "Universal Turing Machine U" processing input tape illustrations. Warm daylight fills the scene.

A bright, airy university classroom scene with a large whiteboard showing Chomsky's hierarchy as a clean nested diagram: four concentric ovals labeled "Regular," "Context-Free," "Context-Sensitive," and "Recursively Enumerable" in bold colors. Center focus: a cheerful cartoon Turing machine tape highlighted between two boundary markers, showing input symbols with a read/write head confined strictly within bounds. Arrows connect the tape to grammar production rules like "αAβ → αγβ" written clearly nearby. Sunlight streams through windows.

A bright university whiteboard filled with a clean CSP diagram: three labeled circles X₁, X₂, X₃ connected by colored constraint arcs, each with small domain boxes listing values {1,2,3}. A student points confidently at a propagation arrow eliminating an invalid value, while a second student sketches a search tree branching into valid and pruned paths. Warm daylight streams through tall windows, books and laptops open nearby.

A bright university whiteboard filled with clean diagrams showing two labeled boxes "Problem A" and "Problem B" connected by a bold arrow marked "poly-time reduction f(x)." A confident student points to a colorful flowchart illustrating an input instance transforming step-by-step into an equivalent instance. Sunlit classroom, warm yellow light, tidy desk with open textbooks. Small accurate labels read "YES/NO," "NP-Complete," and "O(n^k)" beside clear geometric transformation arrows.

A bright university classroom whiteboard filled with a clean Venn diagram showing overlapping regions labeled "P," "BPP," and "RP" in bold colors. A cheerful student tosses a coin while two flowcharts branch into "YES (≥2/3)" and "NO (≥2/3)" paths with checkmarks. Small probability bars show error bounds below 1/3. Sunlight streams through tall windows onto scattered textbooks and a laptop displaying a polynomial-time graph curve.

A bright university lecture hall bathed in morning sunlight. A large whiteboard displays a clean diagram: three labeled boxes — "Axioms," "Derivation Rules," and "Proof Output" — connected by bold arrows, illustrating a formal proof system pipeline. A enthusiastic professor points to a complexity chart comparing proof lengths across systems labeled "Resolution," "Frege," and "Extended Frege." Colorful sticky notes and open textbooks surround attentive students at desks.

A bright university lecture hall bathed in warm sunlight, where a cheerful professor at a whiteboard sketches an elegant diagram showing nested complexity classes: a sunny yellow circle labeled **P**, inside a larger orange circle **NP**, surrounded by a vibrant blue ring **IP = PSPACE**. Two students enthusiastically point at arrows labeled **"Prover ↔ Verifier"**, illustrating an interactive proof exchange. Clean geometric shapes and bold colors fill the crisp white board.

A bright university lecture setting with a large whiteboard displaying a clean Boolean circuit diagram: labeled gates (AND, OR, NOT) connected by crisp colored wires flowing left to right, inputs labeled x₁, x₂, x₃ feeding into progressively layered gates toward a single output. A cheerful professor points enthusiastically at a highlighted lower-bound inequality "C(f) ≥ 2ⁿ/n." Sunlight streams through tall windows, casting warm light across the organized, colorful circuit diagram.

A bright university whiteboard scene bathed in warm daylight. Two students stand at a large white board divided into clean columns labeled "Players," "Strategies," and "Payoffs." A colorful directed graph shows nodes representing players connected by arrows labeled with payoff values. A boxed Nash equilibrium formula sits prominently. Nearby, a complexity ladder chart shows P, NP, PPAD tiers in bold colors. Game pieces — chess pawns — rest on a gridded payoff matrix below, grounding abstract theory in friendly visual metaphor.

A bright university study lounge with large sunny windows. A student at a clean white desk examines two printed binary strings: one long random sequence labeled "HIGH K(x)" and one short structured pattern labeled "LOW K(x)" with a compact description arrow beneath it. A cheerful illustrated Turing machine diagram hangs on the wall. Color-coded compression arrows show long strings shrinking to shorter ones, emphasizing compressibility visually.

A bright university computer lab with large sunny windows showing blue sky. A clean whiteboard displays a colorful tree diagram of divide-and-conquer task decomposition: one large block splitting into four smaller labeled blocks ("Task 1," "Task 2," "Task 3," "Task 4"), each assigned to illustrated CPU cores numbered 1–4. Colored arrows show parallel execution paths converging to a single "Result" block. Students lean forward engaged, laptops open showing core utilization bar graphs.