| 2025-07-22 | RM of Springfield Planning Meeting April 24, 2025 (Zoom Footage) | 0:00 | 29 | |
|
| 2025-06-30 | RM of Springfield Planning Meeting January 23, 2025 (Zoom Footage) | 0:00 | 146 | |
|
| 2025-04-28 | Every Proper Binary Tree of Height h has at Most 2^h Leaves [PROOF] (Maths for Computer Science) | 0:00 | 75 | |
|
| 2025-04-23 | RM of Springfield 2025 Financial Plan Hearing, April 22, 2025 (Zoom Footage) | 0:00 | 199 | |
|
| 2025-03-10 | Transducers Examples - Copying Data (Theory of Computing) | 0:00 | 30 | |
|
| 2025-03-07 | Dan Plays Romancing SaGa 2: Revenge of the Seven (Part 1) | 0:00 | 22 | | Romancing SaGa 2: Revenge of the Seven
|
| 2025-03-05 | Fun with Binary Trees | 0:00 | 49 | |
|
| 2025-03-03 | Transducers Example - Capitalization (Theory of Computing) | 0:00 | 29 | |
|
| 2025-02-25 | Borrowing By-Law Presentation and Discussion - RM of Springfield Feb 18, 2025 Council Meeting | 0:00 | 30 | |
|
| 2025-02-24 | Transducers, Unary Addition (Theory of Computing) | 0:00 | 70 | |
|
| 2025-02-19 | Budget Consultation Meeting of RM of Springfield, February 13, 2025 | 0:00 | 133 | |
|
| 2025-02-18 | Introduction to Turing Machines - Live Lecture Feb 17, 2025 | 0:00 | 106 | |
|
| 2025-02-12 | Mayor of RM of Springfield Limits Video Documentation of Meetings by Residents - COW Feb 11, 2025 | 0:00 | 146 | |
|
| 2025-01-14 | "Has All of Council Read the By-Law?"(Short Version) RM of Springfield, Council Meeting Dec 17, 2024 | 0:00 | 22 | |
|
| 2025-01-10 | Mayor Therrien Yells at Resident of the RM of Springfield, Council Meeting, September 17, 2024 | 0:00 | 46 | |
|
| 2025-01-10 | "How Does Removing Question Time Best Serve Us?" RM of Springfield, Council Meeting, Dec 17, 2024 | 0:00 | 47 | |
|
| 2025-01-09 | The Last Question of the Last Question Period: RM of Springfield, Council Meeting Dec 17, 2024. | 0:00 | 80 | |
|
| 2025-01-08 | A Darkest Day in the RM of Springfield - Procedure By-Law 24-10, Council Meeting, December 17, 2024 | 0:00 | 226 | |
|
| 2025-01-02 | Dr. Page's Presentation to RM of Springfield Council on Procedure By-Law, December 17, 2024 | 0:00 | 108 | |
|
| 2024-09-20 | Frances Widdowson: A Hope for a Reckoning in Canadian Universities | 0:00 | 358 | |
|
| 2024-09-18 | Dr. Page's Presentation to RM of Springfield Council on Charter Rights Concerns, September 17, 2024 | 0:00 | 121 | |
|
| 2023-12-14 | Inclusion Through Exclusion: The Culling of Academics in Canadian Universities | 1:24:27 | 348 | |
|
| 2023-10-31 | Happy Halloween 2023 #halloween2023 | 0:16 | 20 | |
|
| 2023-10-08 | Dan Plays Mega Man 6 (October 7, 2023) | 2:02:34 | 19 | Let's Play | Mega Man 6
|
| 2023-09-02 | Dan Plays Gravity Circuit (September 1, 2023) | 3:34:05 | 58 | | Gravity Circuit
|
| 2023-08-12 | Dan Plays Chrono Trigger (Finale - August 11, 2023) | 3:01:42 | 72 | Let's Play | Chrono Trigger
|
| 2023-08-07 | Happy Summer from PageWizard GL&E | 0:18 | 31 | |
|
| 2023-07-14 | Dan Plays Chrono Trigger and LoZ Tears of the Kingdom (Spoilers, July 13, 2023) | 5:25:09 | 48 | Let's Play | Chrono Trigger
|
| 2023-07-05 | Introduction to Debugging (Python) | 20:01 | 175 | |
|
| 2023-06-09 | Let's Make Something New! (Spring/Summer 2023 Updates) | 3:31 | 214 | Vlog |
|
| 2023-05-31 | Designing Pushdown Automata (Theory of Computing) | 11:07 | 218 | |
|
| 2023-05-29 | Instantaneous Descriptions, Language of a Pushdown Automaton (Theory of Computing) | 32:58 | 43 | |
|
| 2023-05-26 | Representing Pushdown Automata (Basic Example) [Theory of Computing] | 22:08 | 66 | |
|
| 2023-05-24 | Introduction to Pushdown Automata (Theory of Computing) | 43:08 | 106 | |
|
| 2023-05-22 | Regular Languages are Context-Free & More! (Theory of Computing) | 29:09 | 135 | |
|
| 2023-05-19 | Designing Context-Free Grammars III (Theory of Computing) | 15:34 | 134 | |
|
| 2023-05-17 | Designing Context-Free Grammars II (Theory of Computing) | 10:10 | 19 | |
|
| 2023-05-15 | Designing Context-Free Grammars I (Theory of Computing) | 23:44 | 22 | |
|
| 2023-05-12 | Proving a Context-Free Grammar is Correct (Theory of Computing) | 33:19 | 46 | |
|
| 2023-05-10 | Introduction to Context-Free Grammars and Languages (Theory of Computing) | 1:09:20 | 29 | |
|
| 2023-05-08 | Testing Set Membership and Equality of Regular Languages (Theory of Computing) | 17:59 | 24 | |
|
| 2023-05-05 | Testing Emptiness of a Regular Language (Theory of Computing) | 15:46 | 28 | |
|
| 2023-05-03 | Reversal of a Regular Language is Regular (Theory of Computing) | 12:03 | 15 | |
|
| 2023-05-01 | Intersection and Set Difference are Closed Under Regular Languages (Theory of Computing) | 10:55 | 19 | |
|
| 2023-04-28 | Complement is Closed for Regular Languages (Theory of Computing) | 16:59 | 12 | |
|
| 2023-04-26 | Non-Regular Language with Equal Sums and More! (Theory of Computing) | 13:09 | 10 | |
|
| 2023-04-24 | Language with More 0s Before Less 1s is not Regular (Theory of Computing) | 9:39 | 20 | |
|
| 2023-04-21 | Dan Plays Chrono Trigger (April 20, 2023) | 2:45:37 | 29 | Let's Play | Chrono Trigger
|
| 2023-04-21 | Language of Palindromic Strings is not Regular (Theory of Computing) | 14:34 | 37 | |
|
| 2023-04-19 | Language with Prime-Length Strings is not Regular [using Pumping Lemma] (Theory of Computing) | 15:56 | 12 | |
|
| 2023-04-19 | It's Poppin' Time! | 0:05 | 835 | |
|
| 2023-04-19 | Pushdown Automata | 3:03:37 | 16 | |
|
| 2023-04-17 | Tips on Using the Pumping Lemma to Prove Languages are Not Regular (Theory of Computing) | 36:05 | 18 | |
|
| 2023-04-14 | Caesar Cipher, Shift Cipher Cryptanalysis (Introductory Cryptography) | 19:51 | 125 | |
|
| 2023-04-14 | Dan Plays Chrono Trigger (April 13, 2023) | 2:31:53 | 10 | Let's Play | Chrono Trigger
|
| 2023-04-12 | Shift Cipher (Introductory Cryptography) | 39:38 | 18 | |
|
| 2023-04-12 | Context-Free Grammars and Languages II | 1:56:28 | 10 | |
|
| 2023-04-10 | Cryptography: Basic Terminology, Communication Channel (Introductory Cryptography) | 41:23 | 35 | Vlog |
|
| 2023-04-07 | Application of the Pumping Lemma: Not All Languages are Regular (Theory of Computation) | 23:14 | 13 | |
|
| 2023-04-05 | The Pumping Lemma for Regular Languages [FULL PROOF] (Theory of Computing) | 29:54 | 17 | |
|
| 2023-04-03 | Pumping Lemma for Regular Languages: A Gentle Introduction (Theory of Computing) | 27:54 | 25 | |
|
| 2023-04-01 | Dan Plays Chrono Trigger (March 31, 2023 - Part 2) | 1:46:09 | 13 | Let's Play | Chrono Trigger
|
| 2023-04-01 | Dan Plays Chrono Trigger (March 31, 2023 - Part 1) | 1:11:24 | 17 | Let's Play | Chrono Trigger
|
| 2023-03-31 | Algebraic Laws of Regular Expressions and More! (Theory of Computing) | 16:53 | 18 | |
|
| 2023-03-29 | Applying Kleene's DFA to Regex Construction (Theory of Computing) | 30:11 | 14 | |
|
| 2023-03-29 | Exploring Properties of Regular Languages | 2:06:42 | 15 | |
|
| 2023-03-27 | Converting DFAs/NFAs to Regular Expressions - Kleene's Construction (Kleene's Theorem (Part 2)) | 1:02:34 | 16 | |
|
| 2023-03-26 | The State of Academic Freedom in Canada | 2:00 | 432 | |
|
| 2023-03-24 | Converting Regular Expressions to ε-NFAs - Thompson's Construction (Kleene's Theorem (Part 1)) | 49:03 | 26 | |
|
| 2023-03-24 | Dan Plays Chrono Trigger (March 23, 2023 - Technical Issues) | 45:30 | 16 | Let's Play | Chrono Trigger
|
| 2023-03-22 | Designing Regular Expressions [FULL EXAMPLES] (Theory of Computing) | 1:12:55 | 20 | |
|
| 2023-03-22 | Proving Languages are Not Regular (via Pumping Lemma) | 2:30:34 | 11 | |
|
| 2023-03-20 | What are Regular Expressions? (Theory of Computing) | 36:25 | 20 | |
|
| 2023-03-19 | Ms. Kitty Reacts to The Grapist | 0:06 | 1,891 | |
|
| 2023-03-17 | Lazy Subset Construction for ε-NFAs (Converting ε-NFAs to DFAs) [Theory of Computing] | 30:54 | 22 | |
|
| 2023-03-17 | Dan Plays Chrono Trigger (March 16, 2023) | 2:26:00 | 10 | Let's Play | Chrono Trigger
|
| 2023-03-15 | How Do ε-NFAs Work? ε-Closures & More! (Theory of Computing) | 23:15 | 8 | |
|
| 2023-03-15 | Introduction to Cryptography | 2:25:39 | 10 | |
|
| 2023-03-13 | What are Nondeterministic Finite Automata with Epsilon-Transitions? (Theory of Computing) | 27:09 | 12 | |
|
| 2023-03-10 | Equivalence of Nondeterministic and Deterministic Finite Automata (Theory of Computing) | 21:28 | 13 | |
|
| 2023-03-10 | Dan Plays Chrono Trigger (March 9, 2023) | 1:38:04 | 16 | Let's Play | Chrono Trigger
|
| 2023-03-08 | Proving the Correctness of the Subset Construction (Theory of Computing) | 22:46 | 11 | |
|
| 2023-03-08 | Pumping Lemma for Regular Languages (Birthday Stream) | 1:52:56 | 13 | |
|
| 2023-03-06 | Applying the Lazy Subset Construction for NFAs (to DFAs) [Theory of Computing] | 16:28 | 16 | |
|
| 2023-03-03 | Lazy Subset Construction (for NFAs to DFAs) [Theory of Computing] | 16:53 | 19 | |
|
| 2023-03-03 | Dan Plays Chrono Trigger (March 2, 2023) | 2:24:00 | 16 | Let's Play | Chrono Trigger
|
| 2023-03-01 | Subset Construction: NFAs to DFAs (Theory of Computing) | 41:45 | 18 | |
|
| 2023-03-01 | Regular Expressions II (Regex to DFA - Kleene's Theorem (Part 2)) | 2:39:37 | 9 | |
|
| 2023-02-27 | Proving NFAs are Correct via State Invariants (Theory of Computing) | 1:00:45 | 12 | |
|
| 2023-02-24 | Designing Nondeterministic Finite Automata (Theory of Computing) | 18:50 | 17 | |
|
| 2023-02-24 | Dan Plays Chrono Trigger (February 23, 2023) | 1:56:07 | 4 | Let's Play | Chrono Trigger
|
| 2023-02-22 | Formal Definition of Computing for NFAs (Theory of Computing) | 23:53 | 18 | |
|
| 2023-02-22 | Regular Expressions I | 3:26:45 | 11 | |
|
| 2023-02-20 | What are Nondeterministic Finite Automata? [Theory of Computing] | 1:02:30 | 18 | |
|
| 2023-02-17 | Dan Plays Chrono Trigger (February 16, 2023) | 2:01:55 | 12 | Let's Play | Chrono Trigger
|
| 2023-02-17 | Rows of Pascal's Triangle Sum to Powers of 2 (Mathematics for Computer Science) | 4:49 | 18 | |
|
| 2023-02-15 | Applying the Binomial Theorem (Mathematics for Computer Science) | 16:42 | 11 | |
|
| 2023-02-15 | Nondeterministic Finite Automata with Epsilon-Transitions | 2:25:05 | 11 | |
|
| 2023-02-13 | The Binomial Theorem (Mathematics for Computer Science) | 50:28 | 9 | |
|
| 2023-02-10 | Dan Plays Monster Hunter Rise: Sunbreak (February 9, 2023) | 1:41:54 | 10 | Let's Play | Monster Hunter Rise
|
