I mean, if python has some unnecessary performance-killing while loops hidden inside, it can be 35000x slower for everything regardless of 'turing-complete'
It seems entirely plausible to me that one could design a slightly-less-dynamic language, using Python-compatible syntax, which meets or outperforms Python on every benchmark which can be written in both languages.
If their language is Turing complete, then I'd bet there are things Python does 35000x faster than Mojo too.