No, I think mostly he's talking about something unrelated and very important. However, his last sentence is exactly as you say: "...In the end, however, an algorithm expressed in prolog can be translated into any of the other languages, demonstrating the eventual equivalence."

And in fact he's totally wrong about logic programming. It is a completely different way to think about things, just like what he's looking for, it just doesn't happen to make for shorter programs. A very good try though.

Just because something is turing complete doesn't mean it is also effective at managing complexity to whatever degree. Any computation that can be expressed in Python can be equivalently expressed in Brainfuck, but one will be much shorter and easier to understand.

Instead, he seems to be asking for a revolutionary solution to the concurrency problem (mixing synchronous and asynchronous execution). That's all well and good, but he'll have to find the back of the line :)