Are two competing programming languages Turing-complete? Can end-users of the program tell which one was used? Do we need more than the two questions above?

Are two competing programming languages Turing-complete? Can end-users of the program tell which one was used? Do we need more than the two questions above? If programmers thought like this HN would be empty!