Lições — Faculdade

A bright university study space with large sunlit windows. A clean whiteboard displays a simple Turing machine diagram: a tape with symbols "0 1 1 0", a read/write head arrow, and state labels "q0 → q1". Nearby, two colorful columns contrast "DECIDABLE ✓" versus "UNDECIDABLE ✗" problems. A student gestures enthusiastically at the board, surrounded by open textbooks and a glowing laptop showing nested function notation.

A bright, sunlit whiteboard in a modern university classroom displays a clean parse tree diagram. At the top, a root node labeled "S" branches into colorful nodes — "NP," "VP" — further splitting into terminal symbols like words and parentheses. A friendly professor points enthusiastically at production rules written beside it: S → NP VP, NP → det N. Textbooks, laptops, and coffee cups sit on desks below, bathed in warm afternoon light.

A bright university classroom with large sunlit windows showing clear blue sky. A cheerful illustrated diagram fills a central whiteboard: a colorful finite automaton with circular labeled states (q0, q1, q2) connected by clean curved arrows showing transitions, alongside a simple pushdown automaton with a friendly stack tower and a Turing machine tape marked with 0s and 1s. A student enthusiastically points at the state diagram, textbooks and laptops open nearby.

A bright university lecture hall with large sunlit windows. A friendly professor gestures toward a clean whiteboard showing a simple diagram: a small labeled dataset of dots flowing through a glowing "Learning Algorithm" box, then an arrow pointing to a larger cloud of new unseen examples marked with checkmarks. Mathematical notation "PAC Learning" and a sample complexity curve sit neatly beside it. Students look engaged, laptops open, books scattered on wooden desks.

Bright university lecture hall bathed in morning sunlight, a large whiteboard displaying three labeled diagrams side-by-side: a cheerful Turing machine with a paper tape marked "0 1 1 0", a colorful finite automata bubble-diagram with labeled states, and a clean lambda calculus expression "λx.x+1". A smiling professor gestures enthusiastically toward the board while curious students take notes at clean wooden desks.

A bright university whiteboard filled with a clean Venn diagram: a sunny yellow circle labeled "P" nested inside a larger sky-blue circle labeled "NP," with a bold orange arc along NP's boundary labeled "NPC." A cheerful student points at the diagram with a marker. Surrounding the board, small icons depict a sorting array (P), a puzzle piece (NP), and interconnected graph nodes (NPC). Warm daylight streams through tall windows.

Bright university classroom with a large whiteboard showing the Chomsky Hierarchy as a clean nested-circle diagram: innermost circle labeled "Regular," surrounded by "Context-Free," then "Context-Sensitive," then "Recursively Enumerable," each ring a different cheerful color. Beside it, a crisp example: "aaabbbccc" with color-coded letter groups connected by arrows showing equal counts n=3. A student points enthusiastically at the diagram in warm daylight.

A bright, sunlit computer science classroom whiteboard shows a clear number line with markers at "OPT" and "≤ρ·OPT," illustrating the approximation ratio ρ. A cheerful student points to a colorful graph where one path is labeled "Exact (NP-hard, slow)" shown faded and tangled, while a clean highlighted path reads "Approx: 1.5×OPT — fast!" Geometric nodes and edges in orange, teal, and yellow fill the board on a crisp white background.

A bright university classroom setting with a large whiteboard showing a friendly robot machine diagram labeled "PDA" with three clear compartments: an input tape reading "a a b b" with an arrow cursor, a state bubble showing "q₀→q₁→q₂", and a tall stack tower with coins labeled "A, A, Z₀" stacking upward. Colorful arrows show push/pop actions. Sunlight streams through windows, books and laptops visible on desks nearby.

Bright university whiteboard in a sunlit classroom showing a clean nested diagram of four concentric oval regions, each a different bold color. Outermost yellow oval labeled "Type 0: Recursively Enumerable," then orange "Type 1: Context-Sensitive," then blue "Type 2: Context-Free," innermost green "Type 3: Regular." Small iconic symbols inside each region — a Turing machine tape, bracketed strings, parse tree, and simple regex pattern respectively.

A bright university study space with warm natural light, where a large whiteboard displays a clean undirected graph: six labeled vertices (A–F) connected by bold colored edges forming visible paths and cycles. A student sketches adjacency relationships while nearby open textbooks show node-edge diagrams. Colored markers highlight different graph components — spanning trees in blue, cycles in orange. A small portrait of Erdős sits propped beside graph theory notes.

Bright top-down grid map on a white background showing a clean pathfinding illustration. A glowing yellow START node connects via a highlighted teal optimal path through numbered weighted grid squares to a red GOAL node. Green explored nodes surround the path. A small floating formula panel reads **f(n) = g(n) + h(n)**, with arrows labeling g(n) as "actual cost" and h(n) as "heuristic estimate." Cheerful robots walk along the winning route.

A bright, sunlit university whiteboard classroom. A confident student sketches a massive tangled network of nodes and edges labeled "NP-HARD" with a red marker, showing an impossible maze of paths. Nearby, a second whiteboard shows a clean approximated shortcut path highlighted in cheerful yellow, labeled "HEURISTIC ≈ GOOD ENOUGH." Colorful sticky notes reading "Greedy," "Genetic," and "Simulated Annealing" decorate the border. Afternoon sunlight streams through tall windows.

A bright, sunlit computer science classroom with a large whiteboard showing four clearly labeled data structures side by side: a neat horizontal array with numbered boxes, a chain of linked circles, a balanced binary tree with branching nodes, and a colorful hash table grid. A student points enthusiastically at the binary tree, while speed indicators and "O(log n)" labels float above each structure, comparing their efficiency with small clock icons.

A bright university whiteboard scene bathed in warm daylight. A cheerful Turing machine diagram sits center-left, with a clean tape divided into labeled squares. Two clearly marked paths branch from a glowing green decision box: one arrow curves to a sunny "YES ✓" bubble, another to a clear "NO ✗" bubble. A tangled red loop labeled "HALTING PROBLEM" spirals back on itself, showing infinite looping. Bold clean labels read "DECIDABLE" and "UNDECIDABLE" beneath each side.

A bright, sunlit university whiteboard filled with a clean diagram showing a large problem block splitting into smaller subproblems via branching arrows, illustrating divide and conquer. Colorful sticky notes label "Greedy," "Dynamic Programming," and "Backtracking." A simple complexity chart shows O(n), O(n log n), O(n²) curves in blue, green, and red on white graph paper. Open laptops and textbooks sit on a tidy wooden desk nearby.

A bright university whiteboard in a sunlit classroom displays a clean Venn diagram with nested labeled circles: "P" (smallest, yellow), inside "NP" (blue), with "NP-Complete" marked on the boundary and "NP-Hard" extending beyond. A cheerful illustrated professor gestures toward the diagram. Colorful arrows connect example problem icons — a route map, a puzzle piece, a clock — to their respective complexity classes, making the hierarchy instantly readable.

A bright university research lab bathed in afternoon sunlight. A large whiteboard displays interconnected concept bubbles: "Quantum," "Complexity," "P vs NP," with clean arrows linking them. A cheerful student sketches a qubit circuit diagram alongside a classical bit comparison: "0/1" versus a glowing superposition sphere labeled "0+1." Colorful sticky notes surround a laptop showing algorithmic speedup graphs. Books, coffee cups, and equations fill the warm, energetic space.

A bright, airy university whiteboard fills the frame, bathed in warm afternoon sunlight from tall windows. A cheerful illustrated professor points to a clean diagram showing two colorful puzzle shapes labeled "Problem A" and "Problem B" connected by a bold arrow labeled "≤P" with a transformation function "f(x)" beneath it. Small input/output boxes in teal and orange illustrate the mapping. Corner notes show "A ≤P B" in clear chalk lettering.

Bright university study lounge with large sunny windows. A clean whiteboard displays four nested colorful rectangles labeled "Type 0," "Type 1," "Type 2," "Type 3" from outermost to innermost, like a target diagram. A cheerful student points to the innermost rectangle labeled "Regular Languages" while another sketches example strings. Textbooks, coffee cups, and printed grammars sit on a light wooden table. Warm daylight fills the room.

A bright university classroom whiteboard scene showing a cheerful pushdown automaton diagram: a clean machine with labeled states (q0, q1, q2) connected by arrows in sky blue and orange. A tall illustrated stack beside it shows colorful blocks being pushed/popped, with parentheses symbols "( ( ) )" stacked neatly. Small friendly arrows indicate push/pop actions. Input tape reads "((()))" above. Warm sunlight streams through windows, giving the technical diagram a lively, approachable feel.

A bright university study room with large windows and afternoon sunlight. A whiteboard shows a clean Turing machine diagram: a long tape divided into labeled cells with symbols, a read/write head sliding along it, and arrows indicating state transitions. Beside it, a bold "HALT?" question mark with two branches labeled "YES" and "NO." A student points confidently at the diagram, textbooks open nearby, coffee cup on desk.

A bright university classroom with large sunny windows. A cheerful professor points to a clean whiteboard showing a colorful Venn diagram: a yellow circle labeled "P" nested inside a larger blue circle labeled "NP," with "NP-complete" marked at the boundary and "NP-hard" extending outward. A simple graph below shows curves labeled O(n²) and O(2ⁿ) diverging. Students lean forward with notebooks, warm daylight filling the room.

A bright university whiteboard scene flooded with warm daylight. A cheerful diagram maps complexity classes as clean nested colored rings: innermost yellow "P," expanding to orange "NP," then coral "PSPACE," then sky-blue "EXPTIME." A smiling student points to "PSPACE = NPSPACE" with an arrow labeled "Savitch's Theorem." Color-coded memory meters and time meters sit alongside each ring. Crisp, optimistic academic energy throughout.

A bright, sunlit classroom whiteboard split into two halves. Left side shows LINEAR SEARCH: a cheerful row of 8 colorful numbered boxes (1–8), with a magnifying glass hovering sequentially over each box left-to-right, labeled "O(n)". Right side shows BINARY SEARCH: the same sorted row, but the magnifying glass jumps directly to the middle, with arrows halving the remaining section, labeled "O(log n)". Clean blue-and-orange color scheme, clear daylight atmosphere.

Bright university whiteboard in a sunny classroom. A large cheerful graph diagram shows colorful nodes (labeled A–F) connected by bold lines, with a highlighted closed-path loop in vivid orange tracing a Hamiltonian Cycle through every vertex exactly once. Nearby, a clean complexity diagram shows nested circles labeled "P," "NP," and "NP-Hard" in blue, green, and coral. An arrow labeled "poly-time reduction →" connects two smaller graphs, illustrating reducibility clearly.

A bright university lab with large windows letting in sunlight. A whiteboard displays three clean diagrams side by side: a classic finite automaton with labeled states and arrows, a Turing machine with a tape showing symbols, and a probabilistic automaton with percentage-labeled transitions. A student points enthusiastically at the boards while a robot arm on a nearby desk demonstrates a programmed action sequence, with a speech bubble showing NLP text parsing symbols.

Bright university whiteboard scene flooded with warm daylight. Two friendly robot characters stand side by side — one labeled "DFA" following a single clean arrow path through cheerful circular states, the other labeled "NFA" branching into multiple colorful arrow paths simultaneously. States are drawn as bold circles with one double-ringed "accept" state. Small input tape strip shows "a b b a" being read. Clean, colorful, optimistic classroom atmosphere.

A bright university whiteboard scene split into two halves. Left side labeled "DFA" shows a clean state diagram with numbered circles connected by single bold arrows, each labeled "0" or "1," one clear path highlighted in yellow. Right side labeled "NFA" shows the same start state branching into multiple simultaneous arrow paths, some labeled "ε," fanning out to several accept states marked with double circles. Sunny classroom, crisp blue and orange colors, clean white background.

A bright university whiteboard displays a clean complexity hierarchy diagram: "P ⊆ NP ⊆ PSPACE" nested bubble labels in bold colors. A confident student points to the NP bubble with a marker, while textbooks labeled "Algorithms" and a laptop showing a network graph sit on a sunlit desk. Puzzle pieces nearby symbolize NP-hard problems. The room has large windows with warm daylight streaming in, giving an optimistic, energetic academic atmosphere.

Bright university classroom with large whiteboard bathed in warm daylight. A confident student plots a feasible region — a clean shaded polygon — on a crisp coordinate plane drawn on the whiteboard. Labeled axes show x₁ and x₂, constraint lines Ax ≤ b marked clearly, with an arrow indicating the optimal vertex highlighted in orange. Corner labels show "maximize cᵀx" with the feasible region shaded soft blue. Textbooks and a laptop sit neatly on a sunlit desk nearby.

A bright university computer science classroom with large windows letting in sunlight. A whiteboard displays a decision tree branching into colorful paths labeled "YES / NO / MAYBE" with probability values (0.5, 0.3, 0.2). A student tosses a glowing coin while flowchart arrows split into multiple colored routes toward a green "SOLUTION" box. Dice, probability graphs, and the label "Monte Carlo" appear as cheerful pinned diagrams nearby.

A bright, sunlit computer science classroom with a large whiteboard showing the regex pattern `(?P<year>\d{4})-(?P<month>\d{2})-(?P<day>\d{2})` matching the string "2024-03-15." Color-coded arrows label three glowing capture boxes: **year→2024**, **month→03**, **day→15**. Smaller panels show lookahead `(?=...)` and lookbehind `(?<=...)` diagrams as magnifying lenses scanning a cheerful string of characters. Python, JavaScript, and Java logos appear neatly along the bottom border.

Bright university study room with large windows letting in sunshine. A friendly illustrated Turing machine diagram dominates a whiteboard: a long horizontal tape divided into squares containing symbols (0, 1, B), with a labeled read/write head pointing at one cell. Arrows show the head moving left or right. A transition table nearby shows "State, Symbol → New State, Write, Direction." Textbooks and coffee cups sit on a wooden desk below.

A bright, sunlit university study space where two large overlapping circles form a Venn diagram on a whiteboard — one labeled "Mathematics" filled with small icons of graphs, sets, and probability curves, the other labeled "Computer Science" showing binary trees and algorithm flowcharts. The overlapping region highlights "Discrete Math · Logic · Graph Theory." A student points enthusiastically at the intersection, surrounded by clean geometric shapes and colorful connecting arrows on a white background.

A bright, sunlit graph diagram on a clean white background showing six numbered nodes (circles labeled 0–5) connected by weighted edges with small distance numbers. A highlighted "source" node glows yellow, with a green path tracing the shortest route through blue nodes. A small priority queue table alongside shows distance values updating. Colored arrows indicate the greedy selection process, with bold green edges marking confirmed shortest paths, cheerful and clear.

A bright university study space with large windows and natural daylight. A central whiteboard displays two overlapping circles labeled "LOGIC" and "COMPUTATION" with their intersection marked "TCS." Portraits of Gödel and Turing hang above. Scattered across a clean desk: open textbooks, propositional formulas (P∧Q→R), a Turing machine diagram with tape and states, and a cheerful student connecting the two concepts with colored arrows.

A bright, sunlit university commons where four stylized student figures sit around a circular table, each holding strategy cards labeled "A," "B," or "C." Overhead, a clean whiteboard displays a simple 2×2 payoff matrix with bold colored numbers. Connecting lines arc between players like a network diagram, glowing in cheerful yellow and teal. Small icons representing AI, coins, and a network node float nearby as friendly labeled badges.

Bright university whiteboard scene flooded with warm daylight. A clean graph diagram dominates — six labeled circular nodes (A through F) connected by bold lines, some highlighted in vivid orange (BFS frontier) and blue (DFS path). A small queue strip shows "B → C → D" for BFS; a stack shows "A, C, F" for DFS. Friendly arrows trace both traversal paths simultaneously, making the network's structure immediately clear and inviting.

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 at the board sketches an NP complexity landscape as overlapping colored circles labeled P, NP, NP-Complete. Beside the board, a cheerful flowchart shows input transformation steps in blue and orange markers. Sunlight streams through tall classroom windows onto tidy desks with open textbooks.

A bright, sunlit university workspace with a large whiteboard showing interconnected bubbles: a padlock labeled "RSA" linked to "NP-Hard Factoring," a delivery truck labeled "Logistics," and a circuit chip labeled "Algorithms." A confident student sketches arrows connecting real-world icons — a shipping map, encrypted data stream, and supply chain grid — all rendered in clean blues, oranges, and greens on a white background with crisp labeled diagrams.

Bright university whiteboard scene flooded with afternoon sunlight. A cheerful Turing machine diagram sits center-stage: a clean tape with symbols, a labeled read/write head. Two clearly separated zones show "DECIDABLE" problems with a smiling checkmark and finite step-counter, versus "UNDECIDABLE" with an infinite loop arrow. Color-coded problem cards sort neatly into each zone. Fresh markers, open textbooks, and a small robot assistant complete the optimistic, organized classroom atmosphere.

Bright university computer science classroom, sunny white background. A friendly illustrated Turing machine sits center-stage: a cheerful mechanical device with a long horizontal tape stretching both directions, marked with 0s and 1s, a read-write head scanning a cell. A bold red "HALT?" speech bubble floats above. A tangled loop arrow circles back into itself showing paradox. Clean labeled diagram: "HALTS ✓" and "LOOPS ∞" on diverging signpost arrows. Warm blues, oranges, crisp lines.

Bright whiteboard-style diagram on a clean cream background showing a colorful directed flow network graph. Bold nodes labeled S (source, green), A, B, C, D (blue circles), and T (sink, orange) connected by thick arrows with capacity labels like "10", "7", "4". Highlighted augmenting path glows yellow from S to T. Small Ford-Fulkerson annotation reads "max flow = 15." Cheerful, clean, textbook-bright aesthetic with teal and coral accents.

A bright university study space with large sunny windows. A student at a clean white desk connects glowing concept bubbles on a light-colored mind map board: "ML Theory," "Complexity Classes," "Neural Networks," "P vs NP," "Quantum." Colorful arrows show interdisciplinary convergence toward a central hub labeled "Future TCS." Books, a laptop, and geometric circuit patterns surround the cheerful scene in crisp blues, greens, and yellows.

A bright, sunlit university seminar room where a diverse group of students and a professor gather around a large circular table. At the center, a glowing whiteboard displays a simple balanced scale icon with "FAIRNESS" and "BIAS" on each side, alongside a flowchart labeled "AI DECISION." Students hold colorful cards reading "ACCOUNTABILITY," "TRANSPARENCY," and "EQUITY," engaged in animated, optimistic discussion. Clean modern design, warm daylight streaming through tall windows.

Bright whiteboard in a sunny computer science classroom, filled with a clean graph showing runtime (y-axis) versus input size n (x-axis). Colorful curves are clearly labeled: flat O(1) in green, gentle O(log n) in teal, diagonal O(n) in blue, O(n log n) in orange, steep O(n²) in red, and explosive O(2^n) in purple. A friendly professor points to the curves with an enthusiastic smile, daylight streaming through large windows.

A bright, sunlit university lab workspace where a large whiteboard displays an interconnected diagram: a glowing brain outline (labeled "AI") linked by clean arrows to complexity boxes labeled "P," "NP," and "Heuristics." A friendly robot figure stands beside a search-tree diagram with highlighted optimal paths. Colorful sticky notes show "Machine Learning" and "Optimization." Open textbooks, a laptop, and coffee cup complete the energetic, academic atmosphere.

A bright university lecture-style illustration showing a single computation tree branching into multiple colorful paths on a clean white background. A friendly Turing machine tape sits at the top, and bold branching arrows split into three distinct routes — each labeled "Path A," "Path B," "Path C" — fanning outward in yellow, teal, and coral. Some paths end with green checkmarks, others with red X marks. A small deterministic machine below shows one straight sequential path, visually contrasting exponentially longer steps.

A bright university lecture hall bathed in warm afternoon sunlight, where a large whiteboard displays a colorful decision tree for Randomized QuickSort with nodes labeled "pivot?" and branching paths marked O(n log n) in bold blue. A cheerful professor tosses a glowing die to select a pivot element while dart-board-style Monte Carlo circles on a side panel show random dots approximating π. Clean, vivid primary colors, open windows, and crisp diagrams fill the energetic scene.

Bright university study space with large windows letting in afternoon sunlight. A whiteboard displays a clean complexity hierarchy pyramid labeled P, NP, PSPACE in bold colors, with arrows connecting to a flowchart of software validation steps. A focused student sketches a state machine diagram at a wooden desk, surrounded by open textbooks, sticky notes showing Big-O notation, and a laptop displaying clean green checkmarks beside verified code modules.

A sunlit university whiteboard filled with a clean, structured inductive proof: "Base Case: n=1 ✓" and "Inductive Step: assume n=k, prove n=k+1" written in bold marker. A confident student points to the logical steps using a colorful pointer. Stacked dominoes beside the board visually illustrate induction's chain reaction. Bright afternoon light streams through tall windows, illuminating scattered textbooks labeled "Algorithms" and "Logic" on a tidy oak desk nearby.

Bright university classroom with large sunlit windows. A cheerful illustrated wall displays three labeled panels side-by-side: a **Turing Machine** showing a white tape with symbols and a read/write head with arrows indicating state transitions; a **Finite Automaton** with clean circular nodes connected by labeled arrows; and **Lambda Calculus** with a simple colorful expression. A friendly professor points enthusiastically at the tape panel. Clean, colorful, optimistic atmosphere.

A bright university lab setting with large windows letting in warm daylight. A student at a clean whiteboard confidently draws a flowchart of a software system, with labeled boxes connected by arrows, each stamped with a green checkmark proving correctness. Beside the flowchart, neat mathematical notation shows a simple Hoare triple: {P} C {Q}. A small rocket and a pacemaker icon sit on a nearby sunlit desk, representing critical systems.

Bright university study space with warm natural light. A large whiteboard displays a clean Turing machine diagram: an infinite tape stretching horizontally with cells containing symbols "0," "1," and "B," a labeled read/write head positioned mid-tape, and a state transition table showing states Q0→Q1. A small portrait labeled "Turing 1936" hangs nearby. Colored arrows illustrate head movement left and right across the cheerful sky-blue tape.

A bright university laboratory with large windows flooding sunlight across clean white workbenches. A cheerful illustrated quantum circuit diagram floats on a glowing whiteboard showing a qubit labeled with both "0" and "1" simultaneously, connected by clean logic gates. A transparent sphere splits into two glowing paths representing superposition. Color-coded Bloch spheres in teal and orange sit beside classical binary coins for comparison, making abstract concepts tangible and inviting.