Me: Ahh! new “almost-linear time matching algorithm” … can we implement it? Codex: No. It just uses a normal algorithm for anything with less than ~10^(30000000000000000000000) vertices. Me: Oh, my graphs aren’t that big.

A dialogue with Codex analyzing the new algorithm from OpenAI. It reports it will need graphs with 1 followed by 30 sextillion zeros in order to work.