Skip to content
Global sound
Connected Components of Chaos

Connected Components of Chaos

by AmCan Tech

Latest episode
Intro to Compiler Theory - Part 1

About this podcast

A podcast where logic meets lunacy, and graphs guide the way through the madness! Join us as we explore the beautiful intersections of mathematical logic, graph theory, discrete math, computer science, and the quirky chaos of everyday life. From proving theorems to untangling graph traversals, we’ll connect seemingly random dots to create a web of ideas that’s as entertaining as it is enlightening.

Episodes

The newest 20 of 21 episodes

  • Intro to Compiler Theory - Part 1 · 19 min · Season 3 Episode 1This is a comprehensive introduction to compiler theory and the systematic process of translating high-level programming languages into machine-executable code. We outline the…
  • Eigenvalues and Eigenvectors: The Secret Sauce of Modern Tech (From Graphics to Google) · 18 min · Season 2 Episode 10This episode outlines Eigenvalues and Eigenvectors in Linear Algebra. We highlight the practical uses of these abstract topics. Visit our website here…
  • Decoding Language: The Power of Context-Free Grammars in Computing · 17 min · Season 2 Episode 9This bonus episode explores what context-free grammars are in automata theorem. Visit our website here: https://sites.google.com/view/connected-components/home
  • Demystifying Automata Theory: From Finite Machines to Regular Languages · 1 h 3 min · Season 2 Episode 8This deep dive offers comprehensive overview of automata theory and formal languages. They begin by introducing finite automata (FA), including Deterministic Finite Automata…
  • Secrets Hidden in PDF Pages · 18 min · Season 2 Episode 7In this episode, we explore a novel method for distributed steganography using PDF files. The technique involves splitting a secret message using secret sharing algorithms and…
  • Finite Automata - What you need to know · 26 min · Season 2 Episode 6Automata theory: it's a computational model study, focusing on finite automata (DFA and NFA) and push-down automata (PDA). The course explores regular languages, their properties…
  • Shamir's Secret: A PayPal Near-Disaster · 8 min · Season 2 Episode 5This account recounts a nightmarish incident at PayPal where a flawed implementation of Shamir Secret Sharing, a cryptographic technique for distributing a secret key among…
  • SLAP and FLOP: Apple Silicon Speculative Execution Attacks · 16 min · Season 2 Episode 4SLAP and FLOP are two new speculative execution attacks targeting Apple's M-series chips. SLAP exploits the Load Address Predictor (LAP) to leak data by predicting incorrect…
  • Subaru Starlink Security Flaw · 11 min · Season 2 Episode 3Security researchers discovered and exploited a vulnerability in Subaru's Starlink connected car system. This flaw allowed unauthorized access to sensitive data, including…
  • Hash Tables: Theory, Implementation, and Universal Hashing · 16 min · Season 2 Episode 2In this episode, we explore hash tables, a data structure designed for efficient insertion, deletion, and searching of data using keys. The document contrasts direct addressing…
  • Suffix Trees: Construction, Properties, and Applications · 10 min · Season 2 Episode 1Today, we are exploring suffix trees, a data structure used for solving string problems.We begin with basic definitions related to strings and alphabets, then introduces suffix…
  • Disjoint Sets: Data Structures and Algorithms · 12 min · Season 1 Episode 10We discuss disjoint sets, also known as union-find data structures. Disjoint sets maintain collections of elements partitioned into non-overlapping sets, each with a…
  • B-Tree Data Structure: Search, Insertion, and Deletion · 18 min · Season 1 Episode 9Jump in and discover the B-tree data structure, a fundamental tool for processing queries on one-dimensional data stored on disk. We explain how B-trees efficiently support range…
  • Tries: Data Structures for String Processing · 16 min · Season 1 Episode 8A Trie, also known as a prefix tree, is a specialized tree-based data structure primarily used for efficiently storing and retrieving strings. Unlike traditional search trees…
  • Topological Sort and Strongly Connected Components · 14 min · Season 1 Episode 7This podcast reviews key concepts related to Depth First Search (DFS) algorithm and its application in topological sorting and finding strongly connected components in graphs…
  • QuickSort and Order Selection · 14 min · Season 1 Episode 6This episode focuses on QuickSort, a divide-and-conquer sorting algorithm, comparing it to MergeSort, and analyzing its average and worst-case time complexities. It then explains…
  • Recurrence Equations and Asymptotic Notation · 20 min · Season 1 Episode 5This episodes presents methods for solving recurrence equations, which are crucial for analyzing the time complexity of recursive algorithms. It introduces asymptotic notations…
  • Physics and Computer Science · 13 min · Season 1 Episode 4The 2024 Nobel Prize in Physics was awarded to John Hopfield and Geoffrey Hinton for their foundational work on artificial neural networks (ANNs). The award citation highlights…
  • Combinatorics: Counting and Permutations · 21 min · Season 1 Episode 3This episode focuses on fundamental counting principles. It covers the product rule, sum rule, and subtraction rule for counting the number of ways to perform tasks that can be…
  • Unlocking the Secrets of Sentential Logic · 14 min · Season 1 Episode 2Dive into the fascinating world of sentential logic! In this episode, we explore the foundations of propositional logic, the art of constructing truth tables, and how logical…

Live, last hour: 9,692 songs on 5,340 stations in 150 countries

Discover the world through radio

More ways to discover (9)

Heard something good? Save it, or open it straight away in Spotify.

Radio Todo ExitosContinue listening