Sign in

Taylor Smith

@taylorjsmith.bsky.social
618 followers 210 following 385 posts

🇨🇦 Theoretical computer scientist. Assistant professor at @stfx-university.bsky.social. Website: taylorjsmith.xyz.

PostsRepliesMedia
Taylor Smith @taylorjsmith.bsky.social · 07/10/2026
A meme that reads "My Research Program / Marked Safe from / OpenAI / Today".
21035
Taylor Smith @taylorjsmith.bsky.social · 06/10/2026
By the way, even as I work through this paper, this little tucked-away paragraph didn't escape me. I'm not a fan of AI companies now trying to launder their proofs through humans. I fear this is going to taint the result, which is a shame given the otherwise-stellar reputation of the human authors.
A screenshot from the "Acknowledgments and Methodology" section of the paper at the top of the thread. It reads:
"An Anthropic employee used an internal research model to investigate open problems in the theory of cryptography. One of them was about cryptographic constructions based on the average-case hardness of Zero-k-Clique. Claude was tasked with verifying and improving the constructions, but instead developed this algorithm, first for the average case, then for the worst case. The session used 16M output tokens with no human input. Anthropic shared the algorithm with the authors in September 2026 under a confidentiality agreement, offered compensation, and provided access to the public version of Claude."
080
Taylor Smith @taylorjsmith.bsky.social · 30/09/2026
Tenure dossier submitted. Alea iacta est.
A screenshot of part of my terminal output after running a page-counting script on my tenure dossier folder. The output reads "Total pages: 5465".
070
Taylor Smith @taylorjsmith.bsky.social · 03/09/2026
My paper I discuss in this thread has now appeared in Discrete Applied Mathematics. You can download it (for free!) here: doi.org/10.1016/j.da...
The first page of my paper, "Primitive two-dimensional words and iterated pedal triangles via symbolic coding", in the journal Discrete Applied Mathematics.
000
Taylor Smith @taylorjsmith.bsky.social · 28/08/2026
Publishing my research as open access for a grand total of $0. The Canadian Research Knowledge Network is one of the best things to happen to Canadian academia. @crkn-rcdr.bsky.social
A screenshot taken from a publisher's website. It lists the Article Processing Charge as $3030 USD, but an Institutional Agreement Discount takes off -$3030 USD from the total, resulting in a final cost of $0 to publish open access.
011
Taylor Smith @taylorjsmith.bsky.social · 25/08/2026
A frame from the show King of the Hill. Hank Hill is sitting at the dinner table with his family, saying "My god, are you still talking?"
020
Taylor Smith @taylorjsmith.bsky.social · 15/08/2026
On top of CIAA/DCFS, I secretly put together a festschrift volume celebrating my PhD supervisor, Kai Salomaa. The idea arose from chats with colleagues at Bletchley Park last year. With the help of Kai's coauthors, students, and friends, it was my pleasure to present the volume to him last week.
A photo of me presenting a festschrift volume dedicated to my PhD supervisor, Kai Salomaa. In the background, projectors are displaying a collage of photos of Kai and his colleagues.
100
Taylor Smith @taylorjsmith.bsky.social · 15/08/2026
A little over two years of planning resulted in a successful week of formal language and automata theory talks at the 30th Int'l Conference on Implementation and Application of Automata (CIAA) and 27th Int'l Conference on Descriptional Complexity of Formal Systems (DCFS), both held at Queen's!
The group photo of attendees at the Conference on Implementation and Application of Automata (CIAA), taken outside of Summerhill at Queen's University in Kingston, Canada.The group photo of attendees at the Conference on Descriptional Complexity of Formal Systems (DCFS), taken outside of Summerhill at Queen's University in Kingston, Canada.
110
Taylor Smith @taylorjsmith.bsky.social · 31/07/2026
Had a fantastic time seeing colleagues and hearing research talks at CiE/MCU 2026 in Trier, Germany this week! The post-proceedings aren't out yet, but in the meantime... Preprint: arxiv.org/abs/2606.31974 Slides: people.stfx.ca/tjsmith/sem/...
A photo of me presenting at MCU 2026 in Trier, Germany.
010
Taylor Smith @taylorjsmith.bsky.social · 23/07/2026
Check out our latest preprint! "Generating Fibonacci Words via the Prefix-Suffix Duplication Operation": arxiv.org/abs/2607.20405 #TCSSky #MathSky
The first page of our preprint, "Generating Fibonacci Words via the Prefix-Suffix Duplication Operation".
111
Taylor Smith @taylorjsmith.bsky.social · 07/07/2026
Some researchers in the hotter or faster-moving fields might not blink twice at this, but as an early-career researcher doing math-heavy work that takes time to get picked up by others, this was pretty neat to see on Google Scholar.
A screenshot of Google Scholar congratulating me on reaching 100 (actually, 102) citations to my various research works. Some very colourful balloons float above a chart showing citations slowly accumulating over the years.
010
Taylor Smith @taylorjsmith.bsky.social · 01/07/2026
Why the unary case? Well, a lot is known about decidability (and complexity) for general 2D automata, but not as much for the unary variant. Also, almost nothing is decidable for 2D automata that can move in 4 directions through the input, but we recover a bit by restricting input head movement.
A screenshot of Tables 1 and 2 from my paper, summarizing the decidability status of various problems for various models of 2D automata.
100
Taylor Smith @taylorjsmith.bsky.social · 01/07/2026
Check out my latest preprint! "Complexity of Universality and Related Decision Problems for Unary Two-Dimensional Automata": arxiv.org/abs/2606.31974 #TCSSky #MathSky
The first page of my preprint, "Complexity of Universality and Related Decision Problems for Unary Two-Dimensional Automata".
100
Taylor Smith @taylorjsmith.bsky.social · 10/06/2026
If you can't get enough automata theory, you'll love the companion volume also due out later this summer. Your bookshelf will be empty without it!
The cover of the proceedings for "Implementation and Application of Automata: 30th International Conference, CIAA 2026", LNCS 16695, edited by yours truly.
010
Taylor Smith @taylorjsmith.bsky.social · 09/06/2026
2024: I'm invited to the GG's Performing Arts Awards as the guest of an honouree. Okay, I should expect to see the GG then. At the reception, I turn and unexpectedly find Mary Simon right in front of me. Her aide-de-camp was between us, but my seat's a few rows behind her on the balcony.
A photograph of former Governor General Mary Simon and others at the Governor General's Performing Arts Awards ceremony in 2024. We're both on the balcony; I'm seated a few rows behind her.
010
Taylor Smith @taylorjsmith.bsky.social · 09/06/2026
2013: I'm an undergrad at Western. I see there's a different flag flying from the University College tower, a blue one instead of the usual Canadian flag. Soon after, I walk by a sleek black sedan, parked with the same flag on the hood. I unknowingly just walked by David Johnston in his car.
A photo of the flag of the Governor General of Canada. The flag is royal blue with a crowned yellow lion, holding a red maple leaf and standing on a red and white wreath.
100
Taylor Smith @taylorjsmith.bsky.social · 05/06/2026
Just received the cover for a hot new title dropping later this summer. Make sure to get your copy, it's a gripping read.
The cover of the proceedings for "Descriptional Complexity of Formal Systems: 27th IFIP WG 1.02 International Conference, DCFS 2026", LNCS 16681, edited by Cezar Câmpeanu, Luca Prigioniero, and yours truly.
110
Taylor Smith @taylorjsmith.bsky.social · 01/06/2026
What's even more unhinged is the reaction by the former EiC of CACM. This behaviour is seriously making me question the utility of renewing my @acm.org membership going forward.
A screenshot of a thread of Twitter posts. The thread reads:
Sam Tobin-Hochstadt (@samth): "Why did CACM just publish a blog post by a B2B SAAS guy about how he's in the middle of vibe-proving P vs NP? What possible editorial process could this have gone through? 
@vardi"
Moshe Vardi (@vardi): "Entertainment :-)"
Sam: "Genuinely, this is incredibly disappointing from what is supposedly the flagship product of our professional society."
Moshe: "It is a blog. Get over yourself."
110
Taylor Smith @taylorjsmith.bsky.social · 29/05/2026
Thanks to Peter Hacker, I've just discovered a brand new and innovative way to teach tree traversals in my algorithms class: introduce students to Wittgenstein's Tractatus. Course evaluations be damned.
An excerpt from Peter Hacker's 2015 article "How the Tractatus was Meant to be Read". The excerpt reads:
"It is on this basis that Wittgenstein proceeds to construct his tree, working level by level. It would no more have been possible to compose the Tractatus in the sequential order of the published text than it would be to paint an original painting complete from left to right (in the way a laser printer reproduces a painting). Rather, the text is built up not by vertical descent, but by horizontal level, every train of thought being followed through as far as possible on the same level of the tree, and only subsequently elaborated on a deeper level of elucidation. By p. 5 of MS 104 (the third page of the text), when he has added a further 26 propositions, the tree, as Dr Bazzocchi explains, looks like this: [illustration of a tree depicting the structure of the text]"
030
Taylor Smith @taylorjsmith.bsky.social · 11/05/2026
Received all of the camera-ready submissions and getting ready to submit the two conference proceedings volumes I've been working on for the past eight months!
Meme image of a man in silhouette, standing in front of a sunset, holding his arms aloft and breaking a chain that once connected his wrists.
010
Taylor Smith @taylorjsmith.bsky.social · 30/04/2026
There's no easy way to condense everything in the paper into posts on here, so I encourage you to read the paper itself. I tried to make the material as accessible as possible to a general math/CS audience. (Plus, there are lots of pictures, and who doesn't like that?)
A figure depicting the iterated pedal triangle construction process for an almost-equilateral triangle. The process takes seven iterations before the resultant pedal triangle is similar to the original triangle.
100
Taylor Smith @taylorjsmith.bsky.social · 30/04/2026
Now, count all primitive 2D words over a binary alphabet; call this \psi_2(m,n). We get a table with some rather fast-growing values. But if we focus on the second row (i.e., the values of \psi_2(2,n)), the number of 2xn primitive 2D words is the same as the number of exact-period-n pedal triangles!
A passage from my 2017 master's thesis. The relevant portion reads:
"A calculation reveals that \psi_2(2, n) is equal to the number of pedal triangles with period n. Presently, it is not known whether there exists a connection between pedal triangles of period n and two-dimensional primitive words of dimension 2xn over a two-letter alphabet, but the fact that the two enumerations agree suggests some sort of bijection between these objects."
100
Taylor Smith @taylorjsmith.bsky.social · 30/04/2026
2. A pedal triangle is constructed by dropping altitudes from a triangle's vertices to intersect the opposite side, then joining the intersection points. We can iterate the process: if a triangle T is similar to its nth pedal but not any other, we say it has exact pedal period n.
An illustration of an example pedal triangle.
100
Taylor Smith @taylorjsmith.bsky.social · 30/04/2026
Check out my latest preprint! "Primitive Two-Dimensional Words and Iterated Pedal Triangles via Symbolic Coding": arxiv.org/abs/2604.26832 #TCSSky #MathSky
The first page of my preprint, "Primitive Two-Dimensional Words and Iterated Pedal Triangles via Symbolic Coding".
130
Taylor Smith @taylorjsmith.bsky.social · 19/04/2026
Learning that 2014 was apparently a huge year for discrete mathematicians, for some reason.
A screenshot of the DBLP page for the journal "Discrete Mathematics". The page lists volumes published by year. Between 2006 and 2013, and between 2015 and 2026, one volume was published per year. In 2014, for some reason, 23 volumes were published.
050
Taylor Smith @taylorjsmith.bsky.social · 09/04/2026
One of my favourite parts of teaching TCS is motivating concepts in a way that goes beyond just the definitions. When we cover grammars, I mention Pāṇini and his work on Sanskrit. Today, I wrote this fun little question. Can anyone familiar with Sanskrit tell me if I made any embarrassing mistakes?
A screenshot of an assignment question I wrote. It reads:
"In the Astadhyayi, Panini developed a grammar for the Sanskrit language. Here, we will use the grammar for a very small subset of Sanskrit.
Consider the following four Sanskrit root words: bhu (to be), kr (to do), path (to read), likh (to write), and vad (to speak). Sanskrit combines root words with endings that depend on the grammatical person and number:
- First person singular: ami
- First person plural: amah
- Second person singular: asi
- Second person plural: tha
- Third person singular: ti
- Third person plural: anti
For example, to say "I read" in Sanskrit, you would say pathami.
Like Panini, we can develop some grammar rules to form Sanskrit words:
- word -> stem ending
- stem -> root a
- a a -> a (sandhi vowel contraction rule)
- bhu -> a (guna vowel gradation rule)
- kr a -> kara (guna vowel gradation rule)
Using our grammar rules, how can we derive the following words?
(a) pathami ("I read", first person singular)
(b) likhamah ("we write", first person plural)
(c) vadasi ("you speak", second person singular)
(d) karatha ("you [all] do", second person plural)
(e) bhavanti ("they are", third person plural)"
020
Taylor Smith @taylorjsmith.bsky.social · 08/04/2026
Either Best Buy is really diversifying their product offerings, or I’ve done something very strange to whatever recommendation algorithm served up this ad.
A screenshot of an ad from Best Buy Canada. The first product shown in the ad carousel is an anatomical model of a “mammary gland in lactation” from Walter Products. It looks exactly like what you think it is.
000
Taylor Smith @taylorjsmith.bsky.social · 22/03/2026
This is something I've had to contend with in my own courses. I regularly tell students about Greibach (grammars), Goldwasser (zero-knowledge proofs), and Williams (matrix multiplication), but so many results in the core curriculum stem from the same group of guys and I don't know how to improve it.
A Twitter thread posted by Aalok Thakkar (@AalokDThakkar) on Mar. 22, 2026. The tweets read, in order:
1. "While there is a dearth of women in computer science, another problem is that the women who are in CS often become invisible. I’ve been teaching Theory of Computation and have comfortably used photos of Turing, Church, and even problematic figures like Minsky and Chomsky."
2. "Only today did I learn that Greibach, of Greibach Normal Form, is a woman. Sheila Adele Greibach is an Emeritus Professor at the UCLA and has worked extensively on contex-free and context-sensitive languages, parsing, automata, and decidability problems."
3. "There are so many excellent women in computer science doing foundational and groundbreaking work. I hope we (I) get better at naming their work, showing their photos, and telling their stories when we teach. This visibility shapes who feels like they belong."
150
Taylor Smith @taylorjsmith.bsky.social · 17/03/2026
That was my second-ever conference (with my first-ever taking place in Halifax the week before)! See you again in August, perhaps?
A group photo from the CIAA 2018 conference.
011
Taylor Smith @taylorjsmith.bsky.social · 03/03/2026
I've updated the Wikipedia article to remove the false claim, and published a note on the article's talk page detailing my findings thus far. Will I uncover the true origins of the term "Atlantic City"? I'm not sure. But I do know, like any sane academic, I won't let go of this hunt anytime soon.
A screenshot of the current version (as of today) of the Wikipedia article on Atlantic City algorithms. The claim of the origin of the term has been removed, and the text has been cleaned up slightly.A screenshot of the talk page for the Wikipedia article on Atlantic City algorithms. I published a note on this page detailing all of the same findings I describe in this thread.
020
Taylor Smith @taylorjsmith.bsky.social · 03/03/2026
So I did what any sane academic would do. I requested a copy from the one place on Earth that still verifiably had a copy: Princeton, where J. Finn got his PhD. But, to my shock, this report didn't use the term "Atlantic City" at all! It talks about Las Vegas and Monte Carlo, but no Atlantic City.
A screenshot of the cover page of Princeton EECS Technical Report 297, "Comparison of Probabilistic Tests for Primality", published in 1982 by James Finn.
100
Taylor Smith @taylorjsmith.bsky.social · 03/03/2026
If you checked Wikipedia, the article on these algorithms claimed for a long time that the term "Atlantic City" originated in an unpublished work of one "J. Finn" from 1982. This same claim appears elsewhere in the literature, going back to at least 1996 in a book on algorithmic number theory.
An excerpt from Bach and Shallit's 1996 text "Algorithmic Number Theory". It reads "The name "Atlantic City" was first used by J. Finn [1982a]."An excerpt from Mollin's 2003 text "RSA and Public-Key Cryptography". It reads "The term "Atlantic City" was first introduced in 1982 by J. Finn in an unpublished manuscript entitled _Comparison of probabilistic tests for primality_."A screenshot of an old version (Nov. 12, 2025) of the Wikipedia article on Atlantic City algorithms. It reads "The term "Atlantic City" was first introduced in 1982 by J. Finn in an unpublished manuscript entitled _Comparison of probabilistic tests for primality_."
100
Taylor Smith @taylorjsmith.bsky.social · 03/03/2026
For the sake of fixing definitions: - Las Vegas algs. always give correct answers, but have unknown runtimes. - Monte Carlo algs. have fixed runtimes, but give correct answers with prob. ≥ 0.5. In the literature, you sometimes also find: - Atlantic City algs., like Monte Carlo but with prob. ≥ 0.75.
A photo of the waterfront at dusk in Atlantic City, New Jersey. Like Las Vegas, the large buildings are lit up in bright lights and neon and extend to the horizon, contrasting the darkening waves rolling on the shore.
100
Taylor Smith @taylorjsmith.bsky.social · 03/03/2026
I fear I've gone down a bit of a rabbit hole over the course of this past week. Read on... Everyone (or at least, every computer scientist) knows there are two kinds of randomized algorithms: Las Vegas and Monte Carlo. But did you know there's a third? I did, or at least I thought I did.
A photo of Las Vegas at night. The grandiose buildings and attractions are all illuminated in bright lights and neon.A photo of the Monte Carlo Casino at dusk. The Beaux-Arts architecture is tastefully illuminated from below, highlighting every detail and facet of the stonework, while a variety of pristine and polished supercars sits outside of the entrance.
130
Taylor Smith @taylorjsmith.bsky.social · 20/02/2026
Some exciting professional news this week: the IEEE has awarded me a senior status to go along with the growing number of gray hairs on my head.
An illustration of my brand-new (digital) IEEE senior membership card, with appropriate personal details censored, of course.
230
Taylor Smith @taylorjsmith.bsky.social · 30/01/2026
I had someone share with me some posts from a different website. I was just sitting here minding my own business, what'd I do to be attacked like this?
A screenshot of three social media posts in a thread. The first post reads "If your surname is the name of a profession, you probably shouldn't give your son a first name that's the name of a different profession, it's confusing". The second post reads "Taylor Smith. Hunter Baker". The third post reads "I read Taylor Smith and I thought about Taylor Swift but completely forgot that Smith wasn't her last name. So for 30 seconds in my head Taylor Smith was a real celebrity."
050
Taylor Smith @taylorjsmith.bsky.social · 28/01/2026
Excited to soon be able to add to my (currently very small) collection of math-related Magic cards that I put on my office door.
A Magic: The Gathering card from the forthcoming "Secrets of Strixhaven" set. The card is titled "Mathemagics". At a cost of 2B2X mana, the "target player draws 2^X cards".
060
Taylor Smith @taylorjsmith.bsky.social · 14/01/2026
Recent news led me to revisit an old cartoon I used to love watching (for some reason) as a kid. I can't believe how well this 25-year-old clip has held up.
100
Taylor Smith @taylorjsmith.bsky.social · 05/01/2026
For what it's worth, I tangled with the same year-of-publication question until I came across this (fascinating!) footnote in Copeland's book "The Essential Turing", and it sounded authoritative enough for me to take it as gospel.
A footnote from Copeland's book "The Essential Turing". It reads: 

"Proceedings of the London Mathematical Society, 42 (1936–7), 230–65. The publication date of ‘On Computable Numbers’ is sometimes cited, incorrectly, as 1937. The article was published in two parts, both parts appearing in 1936. The break between the two parts occurred, rather inelegantly, in the middle of Section 5, at the bottom of p. 240 (p. 67 in the present volume). Pages 230–40 appeared in part 3 of volume 42, issued on 30 Nov. 1936, and the remainder of the article appeared in part 4, issued on 23 Dec. 1936. This information is given on the title pages of parts 3 and 4 of volume 42, which show the contents of each part and their dates of issue. (I am grateful to Robert Soare for sending me these pages. See R. I. Soare, ‘Computability and Recursion’, Bulletin of Symbolic Logic, 2 (1996), 284–321.)
The article was published bearing the information ‘Received 28 May, 1936.—Read 12 November, 1936.’ However, Turing was in the United States on 12 November, having left England in September 1936 for what was to be a stay of almost two years (see the introductions to Chapters 3 and 4). Although papers were read at the meetings of the London Mathematical Society, many of those published in the Proceedings were ‘taken as read’, the author not necessarily being present at the meeting in question. Mysteriously, the minutes of the meeting held on 18 June 1936 list ‘On Computable Numbers, with an Application to the Entscheidungs- problem’ as one of 22 papers taken as read at that meeting. The minutes of an Annual General Meeting held [...]"The continuation of a footnote from Copeland's book "The Essential Turing". It reads: 

"[...] on 12 Nov. 1936 contain no reference to the paper. (I am grateful to Janet Foster, Archives Consultant to the London Mathematical Society, for information.)"
131
Taylor Smith @taylorjsmith.bsky.social · 05/01/2026
Was reminded today that I haven't yet shared my 2025 flight history, which essentially amounted to flying between where I live and where my family lives, together with a fantastic couple of weeks in England. Where will I go in 2026? (Invite me to visit/give a talk/take a vacation!)
A map of my flight history in 2025. I flew a total of 30619km, with a fair share of that distance coming from a couple of trans-Atlantic flights from Canada to England and back again.
000
Taylor Smith @taylorjsmith.bsky.social · 02/01/2026
The cover of the first edition of “Introduction to Automata Theory, Languages, and Computation” by Hopcroft and Ullman.
130
Taylor Smith @taylorjsmith.bsky.social · 25/12/2025
Merry Christmas to all my family and friends, both near and far. 🎄
A photo of my family’s Christmas tree in the living room of the house, adorned with coloured strings of lights, decades of ornaments, and a very retro-looking angel up top encircled by yet more coloured lights.
110
Taylor Smith @taylorjsmith.bsky.social · 19/12/2025
Got to YHZ this afternoon for an outbound flight to see family, took in some Christmas choir singing before breezing through security, then was handed free cookies and hot chocolate as I waited to board the plane. I hope your holiday travel goes as smoothly as mine!
A photo of two homemade shortbread cookies and one pack of Biscoff cookies, on a napkin sitting on my lap.
010
Taylor Smith @taylorjsmith.bsky.social · 10/12/2025
Please submit your research papers and join us at the 27th International Conference on Descriptional Complexity of Formal Systems (DCFS 2026), to be held in Kingston, Canada from August 9 to 11, 2026! Details: research.cs.queensu.ca/dcfs2026/ #tcssky #mathsky
The logo of the DCFS 2026 conference.
041
Taylor Smith @taylorjsmith.bsky.social · 10/12/2025
Please submit your research papers and join us at the 30th International Conference on Implementation and Application of Automata (CIAA 2026), to be held in Kingston, Canada from August 5 to 8, 2026! Details: research.cs.queensu.ca/ciaa2026/ #tcssky #mathsky
The logo of the CIAA 2026 conference.
032
Taylor Smith @taylorjsmith.bsky.social · 02/12/2025
There's a lot of discourse lately around whether PhD holders should be using the title "doctor" (they should), but amidst all that, I've discovered my new favourite title.
A screenshot of part of an email I received. The greeting reads "Good Morning Benevolent Professor".
050
Taylor Smith @taylorjsmith.bsky.social · 25/11/2025
Speaking of my library, I'm the type of person who maintains (more out of necessity, at this point) a spreadsheet of all my books, which means I'm also the type of person who adds each book's LCC number to this spreadsheet. So if you're curious about the makeup of my library, here it is.
A pie chart of books in my personal library sorted by LCC classification. The largest proportion of books (34.7%) fall under the "Language and Literature" category. The next-largest categories are "Science" (28.0%), "History of the Americas" (9.8%), and "Social Sciences" (5.5%).
140
Taylor Smith @taylorjsmith.bsky.social · 19/11/2025
Check out my latest paper in JALC! "Improved Randomized Approximation of Hard Universality and Emptiness Problems": jalc.de/issues/2025/... (arXiv link: arxiv.org/abs/2403.08707) #TCSSky #MathSky
The first page of my paper, "Improved Randomized Approximation of Hard Universality and Emptiness Problems", coauthored with Pantelis Andreou of Dalhousie University and Stavros Konstantinidis of Saint Mary's University.
120
Taylor Smith @taylorjsmith.bsky.social · 02/11/2025
Holy legendary thrift store find! I’ve been lusting after this collection of Dickens’ works for some time, but the prices I saw online put me off of buying the set. This weekend, I snagged 19/21 books for $50 total.
A photo of (most of) the Oxford Illustrated Dickens book set, sitting on a side table in front of my already-full bookshelves.
250
Taylor Smith @taylorjsmith.bsky.social · 29/10/2025
Today in spurious correlations: @blorkatomic.bsky.social discovers the secret to the @torontobluejays.bsky.social winning the World Series.
A scatterplot comparing "number of Home Hardware commercials during game" to "Blue Jays run differential". The data are tightly correlated with r = 0.9945.
130