<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"
    xmlns:video="http://www.google.com/schemas/sitemap-video/1.1">
  <url>
    <loc>https://academa.ai/</loc>
  </url>
  <url>
    <loc>https://academa.ai/lectures</loc>
  </url>
  <url>
    <loc>https://academa.ai/lectures/bloom-filters</loc>
    <lastmod>2026-08-30T17:01:20.638Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SK3W4QJFB6TX2A5JPYD30/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>The Bloom Filter</video:title>
      <video:description>How a Bloom filter tests membership in a few bits per item, why false positives happen, how to pick k, and why deletion is forbidden.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SK3W4QJFB6TX2A5JPYD30/0/dark/master.m3u8</video:content_loc>
      <video:duration>854</video:duration>
      <video:publication_date>2026-08-30T17:01:20.638Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Computer Science</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/clustering-k-means-and-where-it-fails</loc>
    <lastmod>2026-08-30T17:21:39.514Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SM5WHYPTTMJGRFR6PX1HW/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>K-Means, Its Failure Modes, and Gaussian Mixture Models</video:title>
      <video:description>A practical visual guide to k-means iteration, its key failure modes, soft membership, and Gaussian mixtures with learned covariance.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SM5WHYPTTMJGRFR6PX1HW/0/dark/master.m3u8</video:content_loc>
      <video:duration>822</video:duration>
      <video:publication_date>2026-08-30T17:21:39.514Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Machine Learning</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/comparative-advantage-gains-from-trade</loc>
    <lastmod>2026-08-30T17:01:49.311Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SKDV2XQ3YJ11N72FXZ50C/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>Comparative Advantage: Why Both Countries Gain from Trade</video:title>
      <video:description>Why two countries both gain from trade even when one is slower at everything: opportunity cost, specialization and the frontier.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SKDV2XQ3YJ11N72FXZ50C/0/dark/master.m3u8</video:content_loc>
      <video:duration>961</video:duration>
      <video:publication_date>2026-08-30T17:01:49.311Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Economics</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/decision-trees-and-why-forests-beat-them</loc>
    <lastmod>2026-08-30T17:19:25.698Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SM6VREA3SRBZH54JYAS21/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>From One Decision Tree to a Random Forest</video:title>
      <video:description>Grow, overfit, and prune one decision tree, then build a random forest and see why averaging decorrelated trees reduces prediction variance.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SM6VREA3SRBZH54JYAS21/0/dark/master.m3u8</video:content_loc>
      <video:duration>1199</video:duration>
      <video:publication_date>2026-08-30T17:19:25.698Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Machine Learning</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/dimensional-analysis-drag</loc>
    <lastmod>2026-08-30T17:16:09.773Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SKSKEJ949AVPHCC2S9S8R/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>Why Wind Tunnel Models Work: Dimensional Analysis of Aerodynamic Drag</video:title>
      <video:description>Why a scale model predicts the drag on a real aircraft: count the dimensions, derive Reynolds and the drag coefficient, and see where Mach breaks similarity.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SKSKEJ949AVPHCC2S9S8R/0/dark/master.m3u8</video:content_loc>
      <video:duration>1006</video:duration>
      <video:publication_date>2026-08-30T17:16:09.773Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Engineering</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/edit-distance-dp-derivation</loc>
    <lastmod>2026-08-30T17:13:06.506Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SK718NZ7C2RPEYKP7ACXD/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>Edit Distance: From Memorization to Derivation</video:title>
      <video:description>Derive the edit distance recurrence, fill its table cell by cell, recover the edits, and count the work plain recursion repeats.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SK718NZ7C2RPEYKP7ACXD/0/dark/master.m3u8</video:content_loc>
      <video:duration>968</video:duration>
      <video:publication_date>2026-08-30T17:13:06.506Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Computer Science</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/entropy-as-twenty-questions</loc>
    <lastmod>2026-08-30T17:02:48.861Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SK8DRS8REXV7NH21A3VPT/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>From Twenty Questions to Entropy and Huffman Compression</video:title>
      <video:description>Derive entropy from twenty questions, build a Huffman code, compare its length with the limit, and explain when files can compress.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SK8DRS8REXV7NH21A3VPT/0/dark/master.m3u8</video:content_loc>
      <video:duration>871</video:duration>
      <video:publication_date>2026-08-30T17:02:48.861Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Computer Science</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/halting-problem-undecidability</loc>
    <lastmod>2026-08-30T17:07:37.537Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SK9AYK19NKG9DMMFYTY90/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>The Halting Problem Is Undecidable</video:title>
      <video:description>Cantor&#x27;s diagonal, the table of programs against inputs, and the contrary program that proves no halting decider can exist.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SK9AYK19NKG9DMMFYTY90/0/dark/master.m3u8</video:content_loc>
      <video:duration>966</video:duration>
      <video:publication_date>2026-08-30T17:07:37.537Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Computer Science</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/maxflow-mincut-theorem</loc>
    <lastmod>2026-08-30T17:07:33.434Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SKABXWRQJ3FKQRVH35EQB/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>Maximum Flow Equals Minimum Cut: Proof by Example</video:title>
      <video:description>Max flow equals min cut, worked by hand on one small network: augmenting paths, a residual backward edge, and the cut that certifies the answer.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SKABXWRQJ3FKQRVH35EQB/0/dark/master.m3u8</video:content_loc>
      <video:duration>1123</video:duration>
      <video:publication_date>2026-08-30T17:07:33.434Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Computer Science</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/monopoly-marginal-revenue-and-price-discrimination</loc>
    <lastmod>2026-08-30T17:13:18.503Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SKFN0RYCV99HZMTT8CBJP/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>Monopoly, Marginal Revenue, and Price Discrimination</video:title>
      <video:description>Derive monopoly marginal revenue, compare monopoly with competition, and trace welfare under group and perfect price discrimination.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SKFN0RYCV99HZMTT8CBJP/0/dark/master.m3u8</video:content_loc>
      <video:duration>922</video:duration>
      <video:publication_date>2026-08-30T17:13:18.503Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Economics</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/pagerank-the-random-surfer</loc>
    <lastmod>2026-08-30T17:25:45.535Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SKB7NSKN92WWB1RWSY40D/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>How Hyperlinks Become Votes: The PageRank Algorithm</video:title>
      <video:description>Build PageRank from a random surfer on six pages: link matrix, power iteration, damping factor, dangling pages and rank sinks.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SKB7NSKN92WWB1RWSY40D/0/dark/master.m3u8</video:content_loc>
      <video:duration>698</video:duration>
      <video:publication_date>2026-08-30T17:25:45.535Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Computer Science</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/planar-truss-method-of-joints</loc>
    <lastmod>2026-08-30T17:23:58.117Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SM2C33Y3Y89W08TVXEVCE/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>Planar Truss Analysis: Method of Joints</video:title>
      <video:description>Analyse one planar truss by the method of joints: support reactions, joint equilibrium, tension and compression signs, zero force members.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SM2C33Y3Y89W08TVXEVCE/0/dark/master.m3u8</video:content_loc>
      <video:duration>920</video:duration>
      <video:publication_date>2026-08-30T17:23:58.117Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Engineering</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/regex-to-automata</loc>
    <lastmod>2026-08-30T17:01:50.041Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SKC7FQ64TJ1N101W18856/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>Automata Behind Regular Expressions</video:title>
      <video:description>Build the state machine behind a regular expression, run a string through it, determinise it, and meet the two things regexes cannot do.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SKC7FQ64TJ1N101W18856/0/dark/master.m3u8</video:content_loc>
      <video:duration>1044</video:duration>
      <video:publication_date>2026-08-30T17:01:50.041Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Computer Science</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/the-market-for-lemons-how-hidden-quality-can-cause-a-market-collapse</loc>
    <lastmod>2026-08-30T17:25:08.479Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SKMZAETYCGSXHFW1S8YCA/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>The Market for Lemons: How Hidden Quality Can Make Good Products Disappear</video:title>
      <video:description>A used-car example explains adverse selection, market unraveling, the value of visible quality, and what common repairs actually fix.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SKMZAETYCGSXHFW1S8YCA/0/dark/master.m3u8</video:content_loc>
      <video:duration>759</video:duration>
      <video:publication_date>2026-08-30T17:25:08.479Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Economics</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/three-sat-vertex-cover-reduction</loc>
    <lastmod>2026-08-30T17:09:36.822Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SKCWSVAPG524XAQPNBSWY/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>NP-Completeness and Reduction: From Definitions to the 3-SAT to Vertex Cover Proof</video:title>
      <video:description>P and NP defined by verifiers, then the 3-SAT to Vertex Cover reduction built and argued in both directions on one formula.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SKCWSVAPG524XAQPNBSWY/0/dark/master.m3u8</video:content_loc>
      <video:duration>1265</video:duration>
      <video:publication_date>2026-08-30T17:09:36.822Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Computer Science</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/torsion-shafts</loc>
    <lastmod>2026-08-30T17:30:22.537Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SM35EGT0TGJ4CHH8GHCK1/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>Torsion: From Geometry to Shaft Design</video:title>
      <video:description>How twisting a round shaft gives shear strain linear in radius, the torque integral, the polar moment of area, and why drive shafts are tubes.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SM35EGT0TGJ4CHH8GHCK1/0/dark/master.m3u8</video:content_loc>
      <video:duration>764</video:duration>
      <video:publication_date>2026-08-30T17:30:22.537Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Engineering</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/lectures/who-really-pays-a-tax</loc>
    <lastmod>2026-08-30T17:20:11.791Z</lastmod>
    <video:video>
      <video:thumbnail_loc>https://academa.ai/media/l/01M19SKNPZBTDRABZAG9RJ3MMF/0/dark/poster.jpg</video:thumbnail_loc>
      <video:title>Who Really Bears a Tax? Tax Incidence, Elasticity, and Deadweight Loss</video:title>
      <video:description>See how elasticities split a per-unit tax, why remittance rules do not decide incidence, and why deadweight loss rises with tax squared.</video:description>
      <video:content_loc>https://academa.ai/media/l/01M19SKNPZBTDRABZAG9RJ3MMF/0/dark/master.m3u8</video:content_loc>
      <video:duration>829</video:duration>
      <video:publication_date>2026-08-30T17:20:11.791Z</video:publication_date>
      <video:requires_subscription>no</video:requires_subscription>
      <video:live>no</video:live>
      <video:tag>Economics</video:tag>
    </video:video>
  </url>
  <url>
    <loc>https://academa.ai/pricing</loc>
  </url>
  <url>
    <loc>https://academa.ai/privacy</loc>
  </url>
  <url>
    <loc>https://academa.ai/subjects/computer-science</loc>
  </url>
  <url>
    <loc>https://academa.ai/subjects/economics</loc>
  </url>
  <url>
    <loc>https://academa.ai/subjects/engineering</loc>
  </url>
  <url>
    <loc>https://academa.ai/subjects/machine-learning</loc>
  </url>
  <url>
    <loc>https://academa.ai/team</loc>
  </url>
  <url>
    <loc>https://academa.ai/terms</loc>
  </url>
</urlset>
