Someone at work asked if it’s possible to validate credit card numbers with the Luhn algorithm in regex.

Technically, a regular language could recognise valid fixed-length credit card numbers by brute-force enumerating all possible sequences. But as a more general solution, I don’t think DFAs can support the modular arithmetic required for arbitrary sequence lengths…

Possible or not, I feel incredibly nerd sniped.