Leçons — Collège

A bright university classroom with large windows flooding sunlight across a clean whiteboard. A confident student points to a diagram showing a massive composite number **N = p × q** splitting into two prime factors, with a padlock icon sealed shut beside it. Nearby, a colorful complexity ladder illustrates **P**, **NP**, and a lattice grid pattern labeled "post-quantum." Elliptic curves arc smoothly across a side panel in teal and orange, all crisp and energetic.

A bright university study space with large sunny windows. A confident student at a clean whiteboard sketches a cheerful diagram: on the left, labeled "PAC Learning," a small robot efficiently sorting colorful training samples into correct bins. On the right, "VC Dimension" shows a curved hypothesis boundary cleanly separating red and blue dots on a crisp coordinate plane. Formulas like "ε, δ, poly(n)" float neatly as teaching labels. Books and laptops surround the scene in warm daylight.

A bright sunlit whiteboard classroom shows a giant colorful onion cross-section diagram with clearly labeled concentric rings: innermost ring labeled **P**, next ring **NP = Σ₁ᴾ**, then **Π₁ᴾ**, then **Σ₂ᴾ**, **Π₂ᴾ**, and outer rings fading upward labeled **PH**. Small arrows annotate **∃** on Σ layers and **∀** on Π layers. Two illustrated professors sketch the diagram on a clean white background with warm yellow lighting.

A bright university whiteboard fills the background, sunlit from large windows. Two overlapping circles form a Venn diagram labeled "P" and "NP" in bold colors — the P circle contains small icons of sorted lists and arithmetic equations, while the larger NP circle shows a tangled traveler's route connecting city dots. A cheerful student points confidently at the diagram, question mark and equals sign floating between the circles, conveying the unsolved mystery in a clean, optimistic academic setting.

A bright, sunlit university study room where two students sit across a whiteboard table — one labeled "PROVER" and one labeled "VERIFIER" — passing color-coded message cards back and forth. The whiteboard behind them shows a clean dialogue diagram with arrows labeled "claim → challenge → response," and the complexity classes **IP**, **NP**, and **PSPACE** written in bold colorful markers. Potted plants and large windows fill the scene with warm daylight.

Bright university lecture hall with white walls and large sunny windows. A friendly illustrated chalkboard shows two distinct machines side by side: a "UTM" — a cheerful mechanical tape reader with colorful state bubbles labeled Q0, Q1, Q2 — and an "OTM" — the same machine with a glowing yellow oracle box labeled "?" connected by a bright orange cable. Clean arrows show simulation flow between machines, with bold labels "SIMULATE ANY TM" and "ASK ORACLE." Clear, optimistic, modern infographic style.

A bright university whiteboard scene flooded with warm daylight. A friendly robot character demonstrates two machines side by side: a compact Finite Automaton with glowing state bubbles labeled q0→q1→q2 connected by arrow transitions, and a taller Pushdown Automaton stacking colorful blocks labeled A, B, C into a transparent stack tower. A small chalkboard shows "Stack: push/pop" with neat arrows. Books and pencils scattered on a clean desk below.

Bright university lecture hall with large whiteboards flooded in warm daylight. A cheerful professor gestures toward a clean diagram showing circuits of increasing size labeled n=1, n=2, n=3, each circuit drawn as connected logic gates (AND, OR, NOT) growing visibly larger. Beside it, a colorful chart shows "P/poly" with polynomial-size circuit layers. Small labeled envelopes marked "advice string: aₙ" feed into each circuit level, illustrated as helpful input guides. Bold annotations read "NP/poly" and "non-uniform."

A bright university computer science classroom bathed in warm afternoon sunlight. A large whiteboard displays a flowing timeline arrow labeled "t₁ → t₂ → t₃" with puzzle pieces arriving one by one onto a conveyor belt, where a cheerful robot makes decisions at each step. Beside it, a clean diagram shows two parallel paths: "Online Algorithm" versus "Optimal Offline," with a ratio labeled "competitive ratio = c." A student points enthusiastically at the DynFO label on a glowing graph updating in real time on a laptop screen.

Bright university lecture hall with large whiteboard showing a clean Venn diagram: a big circle labeled "NP" containing a smaller circle labeled "P", with a bold question mark between them reading "P = NP?". A cheerful professor points to "SAT" marked on the NP boundary labeled "NP-complete". Colorful sticky notes show "SOLVE: poly time" and "VERIFY: poly time". Sunlit windows, students leaning forward engaged, open laptops, warm yellows and blues throughout.

A bright university study space with large windows letting in afternoon sunlight. A whiteboard displays a horizontal number line stretching infinitely rightward, labeled "ω-words: a b a b a b …" with an arrow continuing off the edge. A cheerful student sketches interconnected state bubbles with colored arrows, marking acceptance conditions labeled "Büchi," "Rabin," and "Muller" in bold teal, orange, and purple. Stacked textbooks and a coffee mug sit nearby on a clean wooden desk.

A bright university computer science classroom with large sunny windows. A whiteboard displays a clean diagram: a labeled call stack growing upward with boxes marked O(n) beside a binary tree showing depth-first search traversal arrows. A student sketches memory blocks on graph paper while pointing to a comparison chart showing "Time vs Space Trade-offs." Color-coded stack frames in blue, green, and orange illustrate recursive depth. A small embedded chip diagram sits nearby labeled "Memory-Constrained."

Bright university lecture hall setting, sunlit whiteboard filled with a clean diagonal grid — rows labeled M₁, M₂, M₃ and columns labeled L₁, L₂, L₃. Checkmarks and X-marks fill grid cells, with a bold diagonal highlighted in yellow. A friendly illustrated Turing machine robot sits beside the board, "flipping" diagonal entries. Arrows show DTIME(n²) strictly inside DTIME(n³), drawn as clean nested colorful ovals labeled with their complexity classes.

Bright university whiteboard scene in a sunlit classroom. A confident student draws two large labeled boxes — "Problem A" and "Problem B" — connected by a bold curved arrow labeled "poly-time reduction." Colorful puzzle pieces flow along the arrow, visually transforming shape as they travel. A complexity ladder on the side shows NP-completeness tiers in cheerful blues and oranges. Clean diagrams, daylight streaming through windows, energetic and optimistic atmosphere.

Bright university whiteboard scene flooded with warm daylight. A cheerful illustrated graph dominates center, plotting clean curves on white grid: gentle rising line labeled "O(n)", steeper curve "O(n²)", and dramatically soaring red curve "O(2ⁿ)" with a small warning flag. Nearby, colorful knapsack icons sit beside numbered boxes representing inputs n=1 through n=10, visually demonstrating growing computation steps with stacked cheerful teal and yellow blocks.

A bright university whiteboard scene bathed in warm daylight. A cheerful diagram shows three overlapping circles labeled **P**, **NP**, and **BQP** in bold colors — blue, orange, and purple — with question marks floating playfully between them. A smiling professor gestures toward the board while quantum circuit diagrams with clean qubit gates sit beside classical flowcharts. Sunlight streams through tall windows, textbooks open on nearby desks.

A bright, sunlit university study room with whiteboards covered in clean diagrams. A friendly illustrated Turing machine — colorful tape with 0s and 1s — sits center-stage. Arrows loop back labeled "Recursive" in green and spiral outward labeled "RE" in blue. A cheerful red HALT sign sits beside an unresolved blinking question mark. Surrounding shelves display labeled folders: "Decidable," "Undecidable," and a glowing theorem-checker screen showing a green checkmark.

A bright university study lounge bathed in afternoon sunlight, where two students stand at a large whiteboard covered with a clean complexity hierarchy diagram showing boxes labeled **P**, **NP**, **NP-hard**, and **NP-complete** with neat arrows indicating polynomial-time reductions. A smiling portrait sketch of Cook and Levin hangs nearby. Colorful sticky notes mark classic problems: SAT, Clique, Vertex Cover. Open textbooks and coffee cups sit on a sunlit table below.

A bright university lecture hall bathed in warm daylight, where a cheerful Turing machine diagram sits on a large whiteboard. A friendly glowing oracle "black box" labeled **ORACLE** floats beside it connected by a clean query arrow. Complexity bubbles labeled **P**, **NP**, and **P≠NP?** hang overhead like colorful balloons. A student at a sunny desk sends a question card toward the oracle, receiving an instant answer card back, illustrating effortless decision-solving beyond standard computation.

A bright university lecture hall bathed in afternoon sunlight, with a large clean whiteboard displaying an interconnected diagram of four labeled computational model nodes: "Turing," "Quantum," "BPP," and "NP," linked by colorful arrows showing complexity relationships. A focused student sketches the Church-Turing boundary as a bold curved line separating regions. Color-coded complexity class bubbles — P inside NP, BPP overlapping — float clearly labeled above, crisp and organized.

Bright university lab setting, sunlit with large windows. A holographic quantum circuit floats above a sleek white desk, showing interconnected qubit nodes glowing in soft blue and gold. A student sketches a diagram comparing classical bits (0/1) and qubits in superposition on a whiteboard labeled "P vs NP?" Colorful complexity class bubbles—P, NP, BQP—overlap like Venn diagrams on a bright poster. Clean, optimistic, academic atmosphere with warm daylight filling the room.

A bright university whiteboard classroom scene. A student confidently draws two parallel flowcharts side by side: left labeled "RANDOMIZED" shows a flowchart with a spinning coin node; right labeled "DETERMINISTIC" shows the same flowchart with a small pseudorandom seed box replacing the coin. A bold arrow labeled "DERANDOMIZE" connects them. Color-coded complexity class bubbles — BPP, P — float nearby with an equals-question-mark between them, under warm overhead lighting.

A bright university study lounge with large sunny windows. A student at a whiteboard sketches an upward-staircase diagram labeled **ω-jump**, each glowing step marked **Σ¹₁, Π¹₁, Δ¹₁** in bold colors. Colorful arrows connect nodes in a **Turing degrees** lattice drawn beside it. Open textbooks, coffee, and sticky notes surround a laptop displaying a clean hierarchical tree. Everything is crisp, daylit, energetic, and intellectually alive.

Bright university classroom with large sunny windows. A cheerful whiteboard displays the Chomsky Hierarchy as a clean nested diagram: four colorful concentric ovals labeled "Regular," "Context-Free," "Context-Sensitive," and "Recursively Enumerable." A friendly robot labeled "LBA" sits inside the context-sensitive oval. Nearby, a student sketches a production rule "αAβ → αγβ" on paper, while stacked grammar textbooks and a glowing lightbulb icon sit on a clean wooden desk.

Bright university lecture hall bathed in warm afternoon sunlight, a large whiteboard displaying a clean nested diagram of complexity classes: a cheerful teal oval labeled "RL" sitting inside a sunny yellow oval labeled "NL," both nested inside a crisp blue rectangle labeled "PSPACE." Small friendly automata machines illustrated as colorful robots with tape heads navigate labeled paths between nodes on a directed graph. Bold arrows show logarithmic space constraints with annotations "log n space" and question marks linking RL and NL with optimistic energy.

Bright university lecture hall with large whiteboards flooded in warm daylight. A professor points enthusiastically at a clean diagram showing two nested boxes labeled "NP-hard" and "FPT" with an arrow labeled "parameter k" bridging them. A graph plots runtime curves: one steep exponential O(2ⁿ) versus a manageable O(f(k)·nᶜ) curve in teal. Students at desks sketch notes, smiling, surrounded by open textbooks and coffee cups.

A bright university whiteboard scene bathed in warm daylight. A professor's hand sketches a clean diagram showing a circular tour connecting city-dots on a sunny Euclidean grid map, labeled "TSP." Nearby, a polynomial curve labeled "O(n^(1/ε))" arcs smoothly above an NP-hard barrier line. A colorful slider marked "ε → 0" shows approximation tightening toward "OPT," with cheerful blue and orange arrows indicating the trade-off between speed and solution quality.

A bright university seminar room with large windows and afternoon sunlight. A professor points to a clean whiteboard showing a Venn-style diagram: labeled regions "P," "NP," "PSPACE" mapped to logic boxes labeled "FO," "∃SO," "SO" with connecting arrows. Students at desks examine logic formula cards. A chalkboard sidebar reads "Fagin's Theorem: NP = ∃SO" in bold. Colorful sticky notes group complexity classes beside their logical language counterparts.

A bright university lecture room with large sunny windows. A professor points to a clean whiteboard showing a Markov chain diagram: labeled nodes "S1 → S2 → S3" with probability values "0.7, 0.3" on arrows. Nearby, a glowing green checkmark sits above a flowchart labeled "Verify?" with branching paths marked "Pass/Fail." Students at modern desks sketch probability trees, colorful dice and bar charts scattered cheerfully across foreground desks.

A bright university lecture hall bathed in warm afternoon sunlight. A confident student at a whiteboard exchanges color-coded question cards with a friendly robot labeled "VERIFIER," while a second figure labeled "PROVER" holds a glowing proof scroll. A large diagram shows a long proof string with only three highlighted red bits being sampled, captioned "PCP: check 3 bits → verify NP." Clean geometric shapes and arrows illustrate the iterative challenge-response dialogue in crisp blues, oranges, and greens.

A bright university whiteboard scene bathed in warm daylight. A crisp graph diagram shows interconnected nodes with a small highlighted "Vertex Cover" set of k=3 red circled vertices covering all edges. Nearby, a clean formula box reads **f(k) · nᴼ⁽¹⁾**, with an arrow labeled "small k = fast!" A friendly timeline axis contrasts "Classical" versus "FPT" complexity zones in blue and green. Scattered textbooks and a laptop reinforce the academic setting.

A bright university lecture hall bathed in warm daylight, where a large whiteboard displays an elegant proof tree branching downward with labeled nodes marked "P," "NP," and "Frege." A focused student sketches connecting arrows between two diagrams: a clean resolution proof ladder on the left and a polynomial-time complexity curve on the right. Color-coded chalk annotations highlight "Cook-Reckhow" bounds. Scattered textbooks and coffee cups rest on sunlit desks nearby.

A bright university computer science lab flooded with afternoon sunlight. A whiteboard displays a clean flowchart branching into multiple colorful probability paths labeled "p=0.5," "p=0.3," "p=0.2." A cheerful student tosses a glowing coin while diverse probability trees, dice, and Monte Carlo scatter plots fan out across illuminated screens nearby. Colorful nodes and edges form a game theory graph, with small padlock icons representing cryptographic security alongside bold efficiency curves on graph paper.

A bright university lecture setting with a large whiteboard displaying a clean Venn diagram: an outer oval labeled "BPP," containing a smaller circle "P," with sibling ovals "RP" and "ZPP" nearby. A cheerful professor tosses labeled coins mid-air while colorful decision-tree branches fan outward. Probability annotations show "error < 1/3" beside BPP. Sunlight streams through tall windows, illuminating the crisp diagram against a white background.

A bright university lecture hall bathed in warm daylight, featuring a large whiteboard displaying three connected panels: a simple Turing Machine diagram with tape cells reading "0 1 1 0," a Lambda Calculus symbol "λx.x" in bold, and Gödel's undecidability symbol "∞?". Three friendly illustrated portraits of Turing, Church, and Gödel sit above their respective contributions. Clean geometric arrows connect the panels, suggesting unified computational theory foundations.

A bright, sunlit classroom whiteboard displays a clean Boolean circuit diagram with labeled nodes: AND, OR, and NOT gates connected by crisp lines flowing left to right. Cheerful color-coded paths highlight "size = 6 gates" and "depth = 3" annotations. Small input nodes labeled x₁, x₂, x₃ feed into the circuit, converging toward a single output node, making the logical flow immediately clear and visually satisfying.

A bright university whiteboard scene flooded with warm daylight. A cheerful illustrated Turing Machine sits at center, connected by a glowing yellow query arrow to a friendly floating "Oracle" box labeled **O**. Two branching pathway signs diverge below: one reads **P^O = NP^O**, the other **P^O ≠ NP^O**, representing Baker-Gill-Solovay's distinct worlds. Colorful complexity bubbles labeled **P**, **NP**, **BPP** orbit overhead. Clean, optimistic, textbook-bright palette throughout.

A bright university whiteboard filled with colorful chalk diagrams showing two interconnected puzzle structures labeled "Problem A" and "Problem B" with a bold arrow marked "Reduction" between them. A cheerful student assembles glowing geometric "gadget" pieces like building blocks, snapping them together. Small nodes and edges form a clean graph on one side; a satisfiability formula with colored variables sits opposite. Sunlit classroom, clean blue-and-yellow palette, energetic and optimistic.

Bright university lecture hall flooded with afternoon sunlight through tall windows. A large whiteboard displays two overlapping circles forming a Venn diagram — one labeled "Complexity Theory" with a P vs NP diagram, the other labeled "Game Theory" with a small payoff matrix, their intersection labeled "Nash Equilibrium." A cheerful professor points to the overlap while students lean forward engaged, laptops open showing game trees and algorithm flowcharts.

A bright university study space with large sunlit windows. A focused student at a clean white desk examines a glowing whiteboard showing a binary string "01101001" beside the label "K(x) = shortest program length." A compact Universal Turing Machine diagram sits nearby with labeled tape. Colorful arrows connect compressed versus incompressible strings, with a small bar chart illustrating Kolmogorov complexity comparisons. Textbooks and coffee cup complete the cheerful academic scene.