Nothing Brite about it
November 21, 2026 at 6:53 PM by Dr. Drang
Siri’s great failing over the past decade and a half has been its contextual ignorance. It treated every request you made as if it were the first chalk markings on a great blank slate, a slate that was immediately washed clean after it answered you. That’s no longer the case with Siri AI. It now keeps track of your conversations, and it can dig through your apps to find information. This is, without question, a tremendous improvement, but I did run into a problem with it about a week ago.
I was out on a walk, listening to one of Apple Music’s built-in playlists, and “I’m Just a Singer (In a Rock and Roll Band)” by the Moody Blues came on. I wasn’t paying close attention, but after a while I realized that I didn’t know who the lead singer was. I knew only that it wasn’t Justin Hayward, who did most of their lead vocals. So I asked Siri, “Who’s singing lead vocals on this song?”
This was a test. I would never have asked the pre-2025 Siri this kind of question. I have asked similar questions over the past year or two, but only because I figured Siri would pass the question along to ChatGPT. And in those cases, I made the question more explicit—something like “Who is the lead singer on the Moody Blues song ‘I’m Just a Singer (In a Rock and Roll Band)’?”—because Siri usually wouldn’t tell ChatGPT what I was listening to.
Siri AI passed the test, telling me it was John Lodge. Great! I decided to do this more often.
A couple of minutes later, “Do It Again” by Steely Dan started playing.1 I had a vague memory of seeing a video of them performing this song on some TV show, with Skunk Baxter playing bongos. Was that just for the TV show, or did he also play bongos on the record? So I asked Siri, “Who’s playing percussion2 on this song?”
Siri answered that Graeme Edge played percussion on “I’m Just a Singer (In a Rock and Roll Band).” A correct answer, but not what I was looking for. I wondered if Siri was running slow and hadn’t updated itself to know what the current song was. So I asked again and got the same answer. Then I asked for the lead vocalist and got an answer of John Lodge again. What the hell?
Then I realized that I had been caught by conversational context. After my first question, in which Siri correctly interpreted “this song” as the song that was currently playing, it treated my later questions as part of an extended conversation about “I’m Just a Singer” and interpreted “this song” accordingly. So I changed my question to “Who is playing percussion on the currently playing song?” This switched Siri’s context, and I got the right answer. (It was V. Feldman, not Skunk Baxter, although Baxter did play guitar on the track.)
I suspect that if more time had passed between the two songs (and my questions), Siri would have changed its interpretation of “this song.” How much time? I have no idea. Despite what George Harrison told us, “this song” has something tricky about it.
Making flippy floppy
November 17, 2026 at 4:27 PM by Dr. Drang
In the wake of last Friday’s ground stoppage, the New York Times pointed me to this article (that should be a gift link) from just a week earlier about outdated computer technology still in use in air traffic control. I was struck by one of the terms used in the article.
The article is titled “Just 2 More Years Until We’re Done With Floppy Disks, F.A.A. Says,” and it includes an explanation of what those mysterious “floppy disks” are for its younger readers.
Most adults barely remember floppy disks, even if they are old enough to have used them. And the idea that such antiquated technology is still used for important jobs two decades into the 21st century seems laughable.
They were originally produced in the early 1970s at an eight-inch diameter, they shrank to 5¼ inches and then 3½ inches.
The original disk was indeed “floppy,” with a soft plastic case. Later versions that became popular in the mid-80s had harder plastic shells, and didn’t flop anymore, but the name stuck.

Image from Tom’s Hardware.
There’s an Apple angle to this. When I bought my first Mac in the spring of 1985, system software, the programs (“apps” hadn’t been invented yet), and my document files were all stored on the 3½-inch medium described above.
But what prompted me to write this was the strong memory that Apple was adamant that these were not “floppy disks.” Apple felt that that term was appropriate for the old-fashioned 5¼-inch disks used in those terribly antiquated IBM PCs,1 but should never be used for the sleek, sturdy, and hard-shelled media used in Macs. Apple insisted on calling the 3½-inch variety “diskettes.”
The argument was that the stiff plastic shell made them not floppy.2 The actual magnetic disk inside the shell was still floppy, but you were never supposed to see that.
As I recall, the Mac community of the time was pretty good about sticking to Apple’s preferred terminology. I still think of floppy disks as being the 5¼-inch variety, but apparently I’m in the minority. As time went by, everything that wasn’t a hard disk became floppy.
Some new Typinator abbreviations
November 16, 2026 at 4:40 PM by Dr. Drang
I mentioned in my last post that I’m learning Julia. I intend to use it for mathematical work, and because Greek letters are used in formulas I’ll be turning into programs, it seemed like a good idea to make it easier to include Greek letters in my code as variable names. Over the weekend, I made a simple Typinator set for that purpose.1
You can download the Typinator set if you think it would be helpful to you. Here’s a list of the Greek letters and their abbreviations.
| Letter | Abbrev | Letter | Abbrev |
|---|---|---|---|
| α | ,,a | Α | ,,A |
| β | ,,b | Β | ,,B |
| γ | ,,g | Γ | ,,G |
| δ | ,,d | Δ | ,,D |
| ε | ,,e | Ε | ,,E |
| ζ | ,,z | Ζ | ,,Z |
| η | ,,y | Η | ,,Y |
| θ | ,,th | Θ | ,,TH |
| ι | ,,io | Ι | ,,IO |
| κ | ,,k | Κ | ,,K |
| λ | ,,l | Λ | ,,L |
| μ | ,,m | Μ | ,,M |
| ν | ,,n | Ν | ,,N |
| ξ | ,,x | Ξ | ,,X |
| ο | ,,on | Ο | ,,ON |
| π | ,,pi | Π | ,,PI |
| ρ | ,,r | Ρ | ,,R |
| σ | ,,s | Σ | ,,S |
| τ | ,,tt | Τ | ,,TT |
| υ | ,,u | Υ | ,,U |
| φ | ,,ph | Φ | ,,PH |
| χ | ,,ch | Χ | ,,CH |
| ψ | ,,ps | Ψ | ,,PS |
| ω | ,,om | Ω | ,,OM |
I never use many of these symbols because they’re too easy to confuse with Latin letters that look the same; this is especially true for the capitals. But once I got started, I just did the whole alphabet anyway. Maybe I’ll delete some of them as time goes on.
The set is defined with a double comma as the common prefix, and the abbreviations expand immediately—no waiting for a word break character.

You may be wondering why I use ,,y as the abbreviation for η. When I need to deal with a rotated coordinate system, ξ and η are typically the symbols I use for the rotated x and y coordinates, so it made sense (to me, anyway) for η to be ,,y.

Other symbols I often use are in another set, Math symbols:
| Symbol | Abbrev | Symbol | Abbrev |
|---|---|---|---|
| × | ,,* | ÷ | ,,/ |
| ∞ | ,,8 | ∴ | ,,… |
| ⇒ | ,,> | ⇔ | ,,<> |
| ′ | ,,ft | ″ | ,,in |
I tend to use the prime and double prime symbols for feet and inches, hence the ft and in in their abbreviations. In the past, I’ve used different abbreviations for some of these, like ;times and ;divide for × and ÷.
A note on the downloads: The two Typinator sets are saved on the server as zip files. Depending on how your browser is configured, they may or may not expand immediately when downloaded. Once they’re expanded, you can add them to your Typinator setup by double-clicking or dragging them into the Typinator window.
Simple little automations like this often save me more time than the more complex ones I often write about. We’ll see how these work out.
-
The Julia REPL has a LaTeX-like way to enter Greek letters, but I want to be able to enter them in my text editor, BBEdit, too. ↩
Steve, Monty, and Julia
November 11, 2026 at 2:34 PM by Dr. Drang
I don’t make a habit of reading obituaries, but I’m glad I clicked the link to this one in yesterday’s New York Times (that should be a gift link). Steve Selvin was a statistician who got his Ph.D. at the University of California, Berkeley, and taught there for many years. He got into the Times because of a probability puzzle he came up with in 1975: the Monty Hall Problem.
I won’t explain the problem here. Most of you already know it, and those who don’t can read the setup in the Wikipedia article. I do want to praise the Times for the cute little interactive game they included in Selvin’s obituary. It allows you to be a Let’s Make a Deal contestant and run through the problem again and again (with your computer playing the Monty Hall role) until you’re convinced that the “switching my choice” strategy is distinctly better than the “sticking with my original choice” strategy. I doubt you have the patience to play it enough times to confirm that switching wins 2/3 of the time and sticking wins 1/3 of the time.
I was less pleased with the explanation the Times gave for the probabilities:
After the first reveal, you have two doors, so you should have a 50-50 chance. Right? But you don’t. The host hasn’t randomly eliminated a door; he has deliberately revealed a goat, using his knowledge of where the car is. Your original door still has a one-in-three chance of hiding the car, while switching gives you a two-in-three chance of winning.
It’s right, of course, but it doesn’t strike me as an actual explanation—it sounds more like a restatement of the answer. To me, the way to think of it is to consider the winning strategy:
If you chose the door with a car behind it on your first guess—which will happen 1/3 of the time—you will win by sticking with that door. If you chose one of the doors with a goat behind it on your first guess—which will happen 2/3 of the time—you will win by switching to the door that Monty didn’t open. Therefore, switching gives you a 2/3 chance of winning.
Everyone’s different, so maybe you don’t need those extra words and the Times explanation is sufficient. Not for me, though.
I mentioned above that although you could play the game in the obituary enough times to get a decent estimate of the probabilities, most of us don’t have that kind of patience. The better way to run lots of simulations in a short time is to use a random number generator to have the computer do all the selecting. I’ve been meaning to try out the Julia programming language for quite a while; this seemed like a good problem to start with.
Here’s my script, switch.jl, for running 10,000 simulations using the “switch” strategy:
1: #!/usr/bin/env julia
2:
3: # Parameters
4: N = 10_000 # Number of trials
5: m = 0 # Number of wins
6:
7: # Loop through N trials, counting the number of wins
8: for i in 1:N
9: # Behind-the-scenes preparation
10: carDoor = rand(1:3)
11: goatDoors = [j for j in 1:3 if j != carDoor]
12:
13: # Player makes initial choice
14: playerDoor = rand(1:3)
15:
16: # Monty chooses an available goat door
17: if playerDoor == carDoor
18: # Pick either of the two available
19: montyDoor = goatDoors[rand(1:2)]
20: else
21: # Pick the one available
22: montyDoor = [j for j in goatDoors if j != playerDoor][1]
23: end
24:
25: # Player switches to the other door
26: playerDoor = [j for j in 1:3 if (j != montyDoor) && (j != playerDoor)][1]
27:
28: # Increment m if the player wins
29: if playerDoor == carDoor
30: global m += 1
31: end
32: end
33:
34: # Print the winning fraction for this strategy
35: println(m/N)
Because I’m new to Julia, I put in lots of comments, so I doubt there’s much need for more explanation. I will say, though, that I suspect a real Julia programmer wouldn’t use list comprehensions as often as I did. There’s probably a function for removing items from a list that’s more elegant than what I did in Lines 11, 22, and 26. I just don’t know what that is yet.
My script for running 10,000 simulations of the “stick” strategy, cleverly named stick.jl, is basically the same:
1: #!/usr/bin/env julia
2:
3: # Parameters
4: N = 10_000 # Number of trials
5: m = 0 # Number of wins
6:
7: # Loop through the N trials, counting the number of wins
8: for i in 1:N
9: # Behind-the-scenes preparation
10: carDoor = rand(1:3)
11: goatDoors = [j for j in 1:3 if j != carDoor]
12:
13: # Player makes initial choice
14: playerDoor = rand(1:3)
15:
16: # Monty chooses an available goat door
17: if playerDoor == carDoor
18: # Pick either of the two available
19: montyDoor = goatDoors[rand(1:2)]
20: else
21: # Pick the one available
22: montyDoor = [j for j in goatDoors if j != playerDoor][1]
23: end
24:
25: # Player sticks with original choice; do nothing
26: playerDoor = playerDoor
27:
28: # Increment m if the player wins
29: if playerDoor == carDoor
30: global m += 1
31: end
32: end
33:
34: # Print the winning fraction for this strategy
35: println(m/N)
The only difference is in Lines 25–26, where I’m basically doing a no-op.
These scripts give different answers each time they’re run because the random number generator starts with a different seed, but the answers are always close to 0.67 for switch.jl and 0.33 for stick.jl. As expected.
Are 10,000 simulations enough? Well, the 95% confidence interval can be calculated through this formula:
which works out to ±0.009 for both strategies. So 10,000 simulations is fine as long as we’re willing to accept the second decimal place to be off by one every now and then.