Hacker News Reader

Typescript's type system is Turing Complete (at least it was for 2.2) [0].

Regexes fundamentally can't do that [1].

A strict theoretical regex yes, but a lot of regex implementations in practice are not strict NFA/DFAs and may indeed be turing complete

I think GP meant PCREs when they said regex. Ar at least the subset of them that doesn't embed perl code.