Épisodes

  • Intro to Compiler Theory - Part 1

    Intro to Compiler Theory - Part 1
    Feb 22 2026
    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 analysis and a backend for target code synthesis. Key phases described include lexical analysis, where text is converted into a token stream, and syntactic analysis, which generates an abstract syntax tree. Then, we further explore semantic analysis, intermediate code generation, and various optimization techniques designed to improve program efficiency. Additionally, we help define the mathematical foundations of language processing, such as regular expressions, finite automata, and the use of symbol tables to manage program identifiers.

    Visit our website here

    This episode includes AI-generated content.
    Voir plus Voir moins
    19 min
  • Eigenvalues and Eigenvectors: The Secret Sauce of Modern Tech (From Graphics to Google)

    Eigenvalues and Eigenvectors: The Secret Sauce of Modern Tech (From Graphics to Google)
    Aug 17 2025
    This episode outlines Eigenvalues and Eigenvectors in Linear Algebra. We highlight the practical uses of these abstract topics.
    Voir plus Voir moins
    18 min
  • Decoding Language: The Power of Context-Free Grammars in Computing

    Decoding Language: The Power of Context-Free Grammars in Computing
    Aug 14 2025
    This bonus episode explores what context-free grammars are in automata theorem.
    Voir plus Voir moins
    17 min
  • Demystifying Automata Theory: From Finite Machines to Regular Languages

    Demystifying Automata Theory: From Finite Machines to Regular Languages
    Aug 13 2025
    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.
    Voir plus Voir moins
    1 h et 4 min
  • Secrets Hidden in PDF Pages

    Secrets Hidden in PDF Pages
    May 20 2025
    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 the method’s resilience to common attacks.
    Voir plus Voir moins
    18 min
  • Finite Automata - What you need to know

    Finite Automata - What you need to know
    Apr 2 2025
    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 is established through the powerset construction, demonstrating that both recognize the class of regular languages, which are shown to be closed under various operations.
    Voir plus Voir moins
    26 min
  • Shamir's Secret: A PayPal Near-Disaster

    Shamir's Secret: A PayPal Near-Disaster
    Mar 29 2025
    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 incompatibility between the Linux and Solaris operating systems, involving a function that truncated long passphrases, led to the team's inability to recover the key. The crisis was ultimately resolved by discovering and correcting the incompatibility. The story concludes with a humorous postscript regarding a backup copy of the key.
    Voir plus Voir moins
    8 min
  • SLAP and FLOP: Apple Silicon Speculative Execution Attacks

    SLAP and FLOP: Apple Silicon Speculative Execution Attacks
    Mar 18 2025
    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 financial details. Researchers demonstrated proof-of-concept attacks recovering data like browsing history and even book excerpts. Mitigation requires software patches from vendors and updated operating systems.
    Voir plus Voir moins
    16 min