Connected Components of Chaos

AmCan Tech

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.

Subscribe Listen in podnod RSS feed Show website

20 episodes
Updated February 22

Episodes20

Newest first

February 22 · 19 min
Intro to Compiler Theory - Part 1
This is a comprehensive introduction to compiler theory and the systematic process of translating high-level programming languages into machine-executable code. We outline the modular architecture of a compiler, divided into a frontend for source...
Aug 17, 2025 · 18 min
Eigenvalues and Eigenvectors: The Secret Sauce of Modern Tech (From Graphics to Google)
This episode outlines Eigenvalues and Eigenvectors in Linear Algebra. We highlight the practical uses of these abstract topics.
Aug 14, 2025 · 17 min
Decoding Language: The Power of Context-Free Grammars in Computing
This bonus episode explores what context-free grammars are in automata theorem.
Aug 13, 2025 · 1 hr 3 min
Demystifying Automata Theory: From Finite Machines to Regular Languages
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...
May 20, 2025 · 17 min
Secrets Hidden in PDF Pages
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...
Apr 2, 2025 · 26 min
Finite Automata - What you need to know
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...
Mar 29, 2025 · 8 min
Shamir's Secret: A PayPal Near-Disaster
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...
Mar 18, 2025 · 15 min
SLAP and FLOP: Apple Silicon Speculative Execution Attacks
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...
Mar 12, 2025 · 10 min
Subaru Starlink Security Flaw
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...
Feb 16, 2025 · 16 min
Hash Tables: Theory, Implementation, and Universal Hashing
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...
Feb 14, 2025 · 9 min
Suffix Trees: Construction, Properties, and Applications
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....
Feb 11, 2025 · 12 min
Disjoint Sets: Data Structures and Algorithms
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),...
Feb 9, 2025 · 17 min
B-Tree Data Structure: Search, Insertion, and Deletion
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...
Jan 25, 2025 · 15 min
Tries: Data Structures for String Processing
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...
Jan 19, 2025 · 14 min
Topological Sort and Strongly Connected Components
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.
Dec 20, 2024 · 14 min
QuickSort and Order Selection
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...
Dec 15, 2024 · 19 min
Recurrence Equations and Asymptotic Notation
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...
Nov 30, 2024 · 12 min
Physics and Computer Science
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...
Nov 26, 2024 · 20 min
Combinatorics: Counting and Permutations
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...
Nov 21, 2024 · 13 min
Unlocking the Secrets of Sentential Logic
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...