Systems which are turing-complete but not turing-equivalent are stronger than turing machines. See: https://en.wikipedia.org/wiki/Hypercomputation

The "All known Turing-complete systems are Turing-equivalent, which adds support to the Church–Turing thesis." thing seems to have an implied "Turing-complete systems that are physically implementable." (I edited the article to add that.)