| 301. | Dan Plays Legend of Zelda: Link's Awakening DX | 2 | | The Legend of Zelda: Link's Awakening
|
| 302. | Basic Exponential Big-Oh Proofs (Big-Oh Bootcamp) | 2 | |
|
| 303. | Introduction to Pushdown Automata (Theory of Computing) | 5 | |
|
| 304. | Proving Correctness of DFAs via State Invariants II [FULL EXAMPLE 2] (Theory of Computing) | 2 | |
|
| 305. | Showing an Algorithm is Incorrect (Example 2) | 2 | |
|
| 306. | Formal Definition of Computing for NFAs (Theory of Computing) | 2 | |
|
| 307. | Introduction to Cryptography | 2 | |
|
| 308. | Sum of Pairs: Lucky 7 (Mathematics for Computer Science) | 2 | |
|
| 309. | Smoothness: Revisiting Harmonic Numbers (Big-Oh Bootcamp) | 2 | |
|
| 310. | Proving 1/n is o(1) (Little-Oh Definition Proof) | 2 | |
|
| 311. | Smoothness Rule [FULL PROOF] (Big-Oh Bootcamp) | 2 | |
|
| 312. | Dan Longplays Xenoblade Chronicles 2 #4 | 2 | | Xenoblade Chronicles 2
|
| 313. | Designing Pushdown Automata (Theory of Computing) | 2 | |
|
| 314. | Single-Source Shortest Path Problem and Dijkstra's Algorithm | 2 | |
|
| 315. | How Do We Know An Algorithm is Incorrect, Shortest Paths, and Minimum Spanning Trees! | 2 | |
|
| 316. | Searching: Algorithms and Lower Bounds | 2 | |
|
| 317. | Designing Context-Free Grammars II (Theory of Computing) | 2 | |
|
| 318. | Intersection and Set Difference are Closed Under Regular Languages (Theory of Computing) | 2 | |
|
| 319. | Exploring Properties of Regular Languages | 2 | |
|
| 320. | Language with Prime-Length Strings is not Regular [using Pumping Lemma] (Theory of Computing) | 2 | |
|
| 321. | Proving the Correctness of the Subset Construction (Theory of Computing) | 2 | |
|
| 322. | Merry Christmas and Happy Holidays Wishes 2022! | 2 | |
|
| 323. | Designing Nondeterministic Finite Automata (Theory of Computing) | 2 | |
|
| 324. | Big-Oh Definition, Proving 2n-1 is O(n) (FULL EXAMPLE) | 2 | |
|
| 325. | Equivalence of Deterministic and Nondeterministic Finite Automata | 2 | |
|
| 326. | Reversal of a Regular Language is Regular (Theory of Computing) | 2 | |
|
| 327. | 4. Deterministic Lower Bound for k-Canadian Travelling (Haunted Escape) | 2 | |
|
| 328. | Properties of Pascal's Triangle (Mathematics for Computer Science) | 2 | |
|
| 329. | Language of Palindromic Strings is not Regular (Theory of Computing) | 2 | |
|
| 330. | Complement is Closed for Regular Languages (Theory of Computing) | 2 | |
|
| 331. | Happy Summer from PageWizard GL&E | 2 | |
|
| 332. | Dan Longplays Xenoblade Chronicles 2 #9 | 2 | Let's Play | Xenoblade Chronicles 2
|
| 333. | Applying Kleene's DFA to Regex Construction (Theory of Computing) | 2 | |
|
| 334. | Formal Definition of Computing for DFAs (Theory of Computing) | 2 | |
|
| 335. | Computing Connected Components of a Graph (Graphs: Algorithms & Theory) | 2 | |
|
| 336. | What are Nondeterministic Finite Automata with Epsilon-Transitions? (Theory of Computing) | 2 | |
|
| 337. | Graphs/Networks, Terminology, and How to Explore Them! | 2 | |
|
| 338. | Dan Plays Mega Man II [Gameboy, Join the Fun!] | 2 | | Mega Man II
|
| 339. | Single-Source Shortest Path Problem (Graphs: Algorithms & Theory) | 2 | |
|
| 340. | Dan Plays Chrono Trigger (February 16, 2023) | 2 | Let's Play | Chrono Trigger
|
| 341. | Regular Languages are Context-Free & More! (Theory of Computing) | 3 | |
|
| 342. | Harmonic Number H(n) is O(log n)) (Big-Oh Bootcamp) | 2 | Vlog |
|
| 343. | The Binomial Theorem (Mathematics for Computer Science) | 2 | |
|
| 344. | Shift Cipher (Introductory Cryptography) | 2 | |
|
| 345. | Application of the Pumping Lemma: Not All Languages are Regular (Theory of Computation) | 2 | |
|
| 346. | Proving NFAs are Correct via State Invariants (Theory of Computing) | 2 | |
|
| 347. | Averaging Principle: Graphs with Less Than n-1 Edges are Disconnected (Maths for Computer Science) | 2 | |
|
| 348. | n Choose k Equals n Choose n-k | 2 | |
|
| 349. | Twitch Clips - Pokemon Silver, December 15, 2021 | 2 | | Pokémon Gold and Silver
|
| 350. | Introduction and Complexity Functions (Big-Oh Bootcamp) | 2 | |
|
| 351. | Lazy Subset Construction (for NFAs to DFAs) [Theory of Computing] | 2 | |
|
| 352. | Non-Regular Language with Equal Sums and More! (Theory of Computing) | 2 | |
|
| 353. | Twitch Livestream November 24, 2021 - Super Mario Land 2 DX [Full Livestream] | 2 | | Super Mario Land 2: 6 Golden Coins
|
| 354. | Proving Correctness of Deterministic Finite Automata, State Invariants (Theory of Computing) | 3 | |
|
| 355. | Testing Set Membership and Equality of Regular Languages (Theory of Computing) | 3 | |
|
| 356. | Language with More 0s Before Less 1s is not Regular (Theory of Computing) | 3 | |
|
| 357. | Lazy Subset Construction for ε-NFAs (Converting ε-NFAs to DFAs) [Theory of Computing] | 3 | |
|
| 358. | Converting DFAs/NFAs to Regular Expressions - Kleene's Construction (Kleene's Theorem (Part 2)) | 3 | |
|
| 359. | Dan Plays Gravity Circuit (September 1, 2023) | 3 | | Gravity Circuit
|
| 360. | Dan Longplays Xenoblade Chronicles 2 #3 | 3 | | Xenoblade Chronicles 2
|
| 361. | Equivalence of Nondeterministic and Deterministic Finite Automata (Theory of Computing) | 3 | |
|
| 362. | Cryptography: Basic Terminology, Communication Channel (Introductory Cryptography) | 3 | Vlog |
|
| 363. | Converting Regular Expressions to ε-NFAs - Thompson's Construction (Kleene's Theorem (Part 1)) | 3 | |
|
| 364. | Computing Paths Using DFS/BFS Trees (Graphs: Algorithms & Theory) | 3 | |
|
| 365. | What is the Averaging Principle? [FULL PROOF & MORE] (Maths for Computer Science) | 3 | |
|
| 366. | Correctness of Dijkstra's Algorithm (Graphs: Algorithms & Theory) | 3 | |
|
| 367. | Dan Longplays Xenoblade Chronicles 2 #5 | 3 | | Xenoblade Chronicles 2
|
| 368. | For any n+1 integers, some difference of two of them is divisible by n - Pigeonhole Principle | 3 | |
|
| 369. | Big-Theta Definition, Usage, Proving 3n^3 + 5 is Θ(n^3) | 3 | |
|
| 370. | Big-Oh is Reflexive [FULL PROOF] (Big-Oh Bootcamp) | 3 | |
|
| 371. | Dan Plays Chrono Trigger (Finale - August 11, 2023) | 3 | Let's Play | Chrono Trigger
|
| 372. | Designing Context-Free Grammars III (Theory of Computing) | 5 | |
|
| 373. | Dijkstra's Algorithm WITH FULL EXAMPLE (Graphs: Algorithms & Theory) | 3 | |
|
| 374. | What are Deterministic Finite Automata (DFAs)? A Conceptual Overview [Theory of Computing] | 3 | |
|
| 375. | What are Nondeterministic Finite Automata? [Theory of Computing] | 3 | |
|
| 376. | Linear Search (Searching: Algorithms and Lower Bounds) | 3 | |
|
| 377. | Dan Plays Sonic Classic 2 (Sonic Fan Game) | 3 | | Sonic the Hedgehog
|
| 378. | Cycle Detection and Path Finding (Graphs: Algorithms & Theory) | 3 | |
|
| 379. | Graph Terminology III: Weighted Graphs (Graphs: Algorithms & Theory) | 3 | |
|
| 380. | Twitch Clips - Mega Man 5, December 15, 2021 | 3 | | Mega Man 5
|
| 381. | Nondeterminism and Nondeterministic Finite Automata | 3 | |
|
| 382. | Generalized Pigeonhole Principle [PROOF & EXAMPLE] (Mathematics for Computer Science) | 3 | |
|
| 383. | Pumping Lemma for Regular Languages: A Gentle Introduction (Theory of Computing) | 3 | |
|
| 384. | Tips on Using the Pumping Lemma to Prove Languages are Not Regular (Theory of Computing) | 3 | |
|
| 385. | Product Rule of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 3 | |
|
| 386. | Caesar Cipher, Shift Cipher Cryptanalysis (Introductory Cryptography) | 3 | |
|
| 387. | What are Regular Expressions? (Theory of Computing) | 3 | |
|
| 388. | 5. Myopic and Comparison Strategies for k-Canadian Travelling (Haunted Escape) | 3 | |
|
| 389. | How to Represent a Graph (Graphs: Algorithms & Theory) | 3 | |
|
| 390. | Dan Longplays Xenoblade Chronicles 2 #6 | 3 | | Xenoblade Chronicles 2
|
| 391. | Transitivity of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 3 | |
|
| 392. | Designing Deterministic Finite Automata (DFAs) [Theory of Computing] | 3 | |
|
| 393. | Dan Plays Pokemon Scarlet (December 1, 2022) | 3 | | Pokémon Scarlet and Violet
|
| 394. | 1. k-Canadian Traveller & Problem Setup (Haunted Escape) | 3 | |
|
| 395. | Binary Search Algorithm (Searching: Algorithms & Lower Bounds) | 3 | |
|
| 396. | What is a Hash Function? (Hashing: Fundamentals and Algorithms) | 3 | |
|
| 397. | 2. Competitiveness of Online Algorithms (Haunted Escape) | 3 | |
|
| 398. | What's with Zero? O(0)? O(1)? Is O(0) = O(1)? | 3 | |
|
| 399. | Graph/Networks and Minimum Spanning Trees, Algorithms and More! | 3 | |
|
| 400. | Basic Concepts (Hashing: Fundamentals and Algorithms) | 3 | |
|
