Connected Components of Chaos

Connected Components of Chaos

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. Visit our site below:

Episodes

Eigenvalues and Eigenvectors: The Secret Sauce of Modern Tech (From Graphics to Google)

August 17, 2025 • 18 mins
This episode outlines Eigenvalues and Eigenvectors in Linear Algebra. We highlight the practical uses of these abstract topics. 
Mark as Played

Decoding Language: The Power of Context-Free Grammars in Computing

August 14, 2025 • 17 mins
This bonus episode explores what context-free grammars are in automata theorem. 
Mark as Played

Demystifying Automata Theory: From Finite Machines to Regular Languages

August 13, 2025 • 63 mins
This deep dive offers comprehensive overview of automata theory and formal languages. They begin by introducing finite automata (FA), including Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA), alongside fundamental concepts like alphabets, strings, and languages, and their associated operations. 
Mark as Played

Secrets Hidden in PDF Pages

May 20, 2025 • 17 mins
In 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 embedding the parts into PDFs by manipulating their internal structure—specifically through hidden pages. We discuss how this approach makes the embedded data virtually invisible to standard PDF readers, the challenges of detecting such hidden content, and th...
Mark as Played

Finite Automata - What you need to know

April 2, 2025 • 26 mins
Automata 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 and proofs of non-regularity using concepts like the pumping lemma and Myhill-Nerode theorem. Foundational mathematical concepts such as set theory, sequences, relations, alphabets, strings, and languages are reviewed. The equivalence between NFAs and DFAs...
Mark as Played

Shamir's Secret: A PayPal Near-Disaster

March 29, 2025 • 8 mins
This account recounts a nightmarish incident at PayPal where a flawed implementation of Shamir Secret Sharing, a cryptographic technique for distributing a secret key among multiple parties, nearly caused a catastrophic system failure. The author, a PayPal engineer, explains the process of Shamir Secret Sharing and how he implemented it to improve security by distributing the master encryption key. However, a seemingly minor incomp...
Mark as Played

SLAP and FLOP: Apple Silicon Speculative Execution Attacks

March 18, 2025 • 15 mins
SLAP 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 memory addresses, while FLOP leverages the Load Value Predictor (LVP) to predict incorrect data values. Both attacks allow unauthorized access to sensitive information from web browsers like Safari and Chrome, compromising data ranging from email content to fin...
Mark as Played

Subaru Starlink Security Flaw

March 12, 2025 • 10 mins
Security researchers discovered and exploited a vulnerability in Subaru's Starlink connected car system. This flaw allowed unauthorized access to sensitive data, including vehicle location history, and control over features like door locks. The vulnerability stemmed from weaknesses in the Starlink admin panel, which was accessible using readily available information and easily bypassed security measures. Subaru patched the issue af...
Mark as Played

Hash Tables: Theory, Implementation, and Universal Hashing

February 16, 2025 • 16 mins
In 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 with hashing, highlighting the space efficiency of hash tables when dealing with large key universes. It discusses collision resolution techniques like chaining and open addressing, exploring the trade-offs between them. Different hashing methods, including ...
Mark as Played

Suffix Trees: Construction, Properties, and Applications

February 14, 2025 • 9 mins
Today, 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 trees as compressed tries containing all suffixes of a given text. Applications include substring searching, finding repeated substrings, and data compression. The discussion covers the construction of suffix trees using tries and compressed suffix trees, al...
Mark as Played

Disjoint Sets: Data Structures and Algorithms

February 11, 2025 • 12 mins
We discuss disjoint sets, also known as union-find data structures. Disjoint sets maintain collections of elements partitioned into non-overlapping sets, each with a representative element. Key operations include Make-Set (creating a new set), Find-Set (locating a set's representative), and Union (merging two sets). Different representations are explored, such as arrays, linked lists, and inverted trees, along with their associated...
Mark as Played

B-Tree Data Structure: Search, Insertion, and Deletion

February 9, 2025 • 17 mins
Jump 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 reporting, successor/predecessor searches, insertion, and deletion operations. 
Mark as Played

Tries: Data Structures for String Processing

January 25, 2025 • 15 mins
A 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 where a node stores the entire key, each node in a trie represents a prefix shared by all its descendants. This unique structure facilitates fast search, insertion, and deletion operations based on string prefixes.
Mark as Played

Topological Sort and Strongly Connected Components

January 19, 2025 • 14 mins
This podcast reviews key concepts related to Depth First Search (DFS) algorithm and its application in topological sorting and finding strongly connected components in graphs. 
Mark as Played

QuickSort and Order Selection

December 20, 2024 • 14 mins
This 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 the order selection problem, which involves finding the kth smallest element in a dataset, presenting several algorithms with varying time complexities and practical considerations, including a linear worst-case algorithm and an approximate heuristic. The ...
Mark as Played

Recurrence Equations and Asymptotic Notation

December 15, 2024 • 19 mins
This episodes presents methods for solving recurrence equations, which are crucial for analyzing the time complexity of recursive algorithms. It introduces asymptotic notations (Big O, Big Omega, Big Theta, little o, little omega) to describe the growth of functions. The lecture then explores several techniques for solving recurrences, including the substitution method, iteration method (and recursion trees), the Master Theorem, an...
Mark as Played

Physics and Computer Science

November 30, 2024 • 12 mins
The 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 their contributions to machine learning, linking ANNs to concepts in physics, such as spin models and statistical mechanics. Hopfield's research focused on recurrent networks and their applications in associative memory and optimization, while Hinton's work ...
Mark as Played

Combinatorics: Counting and Permutations

November 26, 2024 • 20 mins
This 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 broken down into subtasks. Additionally, it explores the pigeonhole principle, counting in two different ways, and the relationship between permutations and combinations. 
Mark as Played

Unlocking the Secrets of Sentential Logic

November 21, 2024 • 13 mins
Dive 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 connectives like "and," "or," and "not" shape our reasoning. Whether you're a philosophy enthusiast, a math lover, or just curious about how we break down complex arguments into their simplest forms, this episode has something for you. Join us as we demystify ...
Mark as Played

Introduction to Graph Theory

November 20, 2024 • 19 mins
This episode explores key concepts in graph theory, starting with fundamental definitions of graphs, vertices, and edges. The text then examines the handshake lemma and related theorems that deal with the relationship between vertex degrees and the number of edges in a graph. 
Mark as Played

Popular Podcasts

    Stuff You Should Know

    Stuff You Should Know

    If you've ever wanted to know about champagne, satanism, the Stonewall Uprising, chaos theory, LSD, El Nino, true crime and Rosa Parks, then look no further. Josh and Chuck have you covered.

    My Favorite Murder with Karen Kilgariff and Georgia Hardstark

    My Favorite Murder with Karen Kilgariff and Georgia Hardstark

    My Favorite Murder is a true crime comedy podcast hosted by Karen Kilgariff and Georgia Hardstark. Each week, Karen and Georgia share compelling true crimes and hometown stories from friends and listeners. Since MFM launched in January of 2016, Karen and Georgia have shared their lifelong interest in true crime and have covered stories of infamous serial killers like the Night Stalker, mysterious cold cases, captivating cults, incredible survivor stories and important events from history like the Tulsa race massacre of 1921. My Favorite Murder is part of the Exactly Right podcast network that provides a platform for bold, creative voices to bring to life provocative, entertaining and relatable stories for audiences everywhere. The Exactly Right roster of podcasts covers a variety of topics including historic true crime, comedic interviews and news, science, pop culture and more. Podcasts on the network include Buried Bones with Kate Winkler Dawson and Paul Holes, That's Messed Up: An SVU Podcast, This Podcast Will Kill You, Bananas and more.

    The Joe Rogan Experience

    The Joe Rogan Experience

    The official podcast of comedian Joe Rogan.

    The Breakfast Club

    The Breakfast Club

    The World's Most Dangerous Morning Show, The Breakfast Club, With DJ Envy, Jess Hilarious, And Charlamagne Tha God!

    New Heights with Jason & Travis Kelce

    New Heights with Jason & Travis Kelce

    Football’s funniest family duo — Jason Kelce of the Philadelphia Eagles and Travis Kelce of the Kansas City Chiefs — team up to provide next-level access to life in the league as it unfolds. The two brothers and Super Bowl champions drop weekly insights about the weekly slate of games and share their INSIDE perspectives on trending NFL news and sports headlines. They also endlessly rag on each other as brothers do, chat the latest in pop culture and welcome some very popular and well-known friends to chat with them. Check out new episodes every Wednesday. Follow New Heights on the Wondery App, YouTube or wherever you get your podcasts. You can listen to new episodes early and ad-free, and get exclusive content on Wondery+. Join Wondery+ in the Wondery App, Apple Podcasts or Spotify. And join our new membership for a unique fan experience by going to the New Heights YouTube channel now!

Advertise With Us
Music, radio and podcasts, all free. Listen online or download the iHeart App.

Connect

Explore

iHeart

Live Radio

Podcasts

Artist Radio

Exclusives

News

Features

Events

Contests

Photos

Information

About

Advertise

Blog

Brand Guidelines

Contest Guidelines

Subscription Offers

Jobs

Get the App

Automotive

Home

Mobile

Wearables

© 2025 iHeartMedia, Inc.