<?xml version="1.0" encoding="UTF-8" ?> <?xml-stylesheet type="text/xsl" href="rss.xsl"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/"> <channel> <title>Exploring Computer Science</title><description>The CS theory behind the production code you write.</description><link>https://cs.bradpenney.io/</link><atom:link href="https://cs.bradpenney.io/feed_rss_updated.xml" rel="self" type="application/rss+xml" /> <managingEditor>Brad Penney</managingEditor><language>en</language> <pubDate>Sun, 14 Jun 2026 01:37:21 -0000</pubDate> <lastBuildDate>Sun, 14 Jun 2026 01:37:21 -0000</lastBuildDate> <ttl>1440</ttl> <generator>MkDocs RSS plugin - v1.19.0</generator> <image> <url>https://cs.bradpenney.io/images/exploring_computer_science.png</url> <title>Exploring Computer Science</title> <link>https://cs.bradpenney.io/</link> </image> <item> <title>Home</title> <description>The CS theory behind the production code you write. Big-O, data structures, algorithms, and computational theory for back-end and platform engineers.</description> <link>https://cs.bradpenney.io/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/</guid> </item> <item> <title>Compilers vs. Interpreters</title> <description>Understand what compilers and interpreters actually do — the CS theory behind how source code becomes running programs, and why it matters for how you write and debug code.</description> <link>https://cs.bradpenney.io/efficiency/compilers_vs_interpreters/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/efficiency/compilers_vs_interpreters/</guid> </item> <item> <title>Computational Thinking</title> <description>Master the mental toolkit of computer science: Decomposition, Pattern Recognition, Abstraction, and Algorithm Design.</description> <link>https://cs.bradpenney.io/efficiency/computational_thinking/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/efficiency/computational_thinking/</guid> </item> <item> <title>Finite State Machines</title> <description>Understanding Finite State Machines (FSMs), the elegant model behind traffic lights, game AI, and compilers.</description> <link>https://cs.bradpenney.io/efficiency/finite_state_machines/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/efficiency/finite_state_machines/</guid> </item> <item> <title>How Parsers Work</title> <description>From raw text to meaning: How parsers use grammars to understand code and data.</description> <link>https://cs.bradpenney.io/efficiency/how_parsers_work/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/efficiency/how_parsers_work/</guid> </item> <item> <title>Lists as Recursive Structures</title> <description>Understand how CS theory defines a list recursively using cons and null, why recursive list operations are natural, and what Python lists, Clojure, and functional languages have in common.</description> <link>https://cs.bradpenney.io/efficiency/lists_recursive_structure/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/efficiency/lists_recursive_structure/</guid> </item> <item> <title>Regular Expressions - The Formal Model</title> <description>How regex engines compile patterns to automata, why backtracking causes production outages, and what regular expressions fundamentally cannot match.</description> <link>https://cs.bradpenney.io/efficiency/regular_expressions/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/efficiency/regular_expressions/</guid> </item> <item> <title>Big-O Notation</title> <description>Understand Big-O notation for software engineers. Learn how to identify O(n²), O(n log n), O(n) complexities and optimize your code for production.</description> <link>https://cs.bradpenney.io/essentials/big_o_notation/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/essentials/big_o_notation/</guid> </item> <item> <title>Recursion</title> <description>Understand the CS theory behind recursive problem solving — base cases, recursive steps, the substitution model, and why recursive algorithms are the natural fit for self-similar problems.</description> <link>https://cs.bradpenney.io/essentials/recursion/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/essentials/recursion/</guid> </item> <item> <title>Regular Expressions</title> <description>The complete practical reference for writing and reading regex in production code — character classes, quantifiers, groups, flags, and common pitfalls.</description> <link>https://cs.bradpenney.io/essentials/regular_expressions/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/essentials/regular_expressions/</guid> </item> <item> <title>Trees</title> <description>Understand the CS theory behind trees — the data structure powering your file system, database indexes, DOM, compiler ASTs, and Git history.</description> <link>https://cs.bradpenney.io/essentials/trees_basics/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/essentials/trees_basics/</guid> </item> <item> <title>Type Systems Basics</title> <description>Understand type systems from a CS theory perspective — what types really are, how type notation works, and why every strongly-typed language enforces the same rules.</description> <link>https://cs.bradpenney.io/essentials/type_systems_basics/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/essentials/type_systems_basics/</guid> </item> <item> <title>What is Computer Science?</title> <description>Computer science isn&#39;t about computers. It&#39;s the systematic study of what can be computed, how efficiently, and how to solve problems algorithmically.</description> <link>https://cs.bradpenney.io/essentials/what_is_computer_science/</link> <pubDate>Sun, 14 Jun 2026 01:36:35 -0300</pubDate> <source url="https://cs.bradpenney.io/feed_rss_updated.xml">Exploring Computer Science</source><guid isPermaLink="true">https://cs.bradpenney.io/essentials/what_is_computer_science/</guid> </item> </channel> </rss>