Ask HN: Analog/Digital Hybrid Computer, Turing Complete?

From Wikipedia: "Turing completeness, named after Alan Turing, is significant in that every plausible design for a computing device so far advanced can be emulated by a universal Turing machine - an observation that has become known as the Church-Turing thesis."

So given an analog or analog/digital hybrid computer, surely it can be argued that this type of computer can not be emulated exactly by a universal Turing machine and yet be capable of solving any computational problem a digital computer can, thus disproving the statement above?