aka Turing universality

https://www.wikiwand.com/en/Turing_completeness

A machine that is universal is an Universal Turing machine is called Turing complete

"Principle of computational equivalence". Stephen Wolfram conjectures that Turing universality is a typical property of simple computing systems It asserts that no system can be super Turing in Nature, isn't this just the Church-Turing thesis?