High Signal Podcasts Evidence ledger
Method
Browse
← Back to evidence

Evidence receipt / observation

Published · transcript-backed

Pedro Domingos: observation

8 Dec 2025 Machine Learning Street Talk Pedro Domingos: Tensor Logic Unifies AI Paradigms

“The point is that first we have to realize that there is 1, we have to prove what it does, and then we can refine it with the syntactic sugars and whatnot, and that's all good.”

— Pedro Domingos

Source trail

Everything needed to verify it.

Speaker
Pedro Domingos
Attribution
Verified speaker
Claim type
observation
Recorded
8 Dec 2025
Publisher
Machine Learning Street Talk

Transcript context

…Yeah. And I just just to cap off the discussion about Alan Turing because I think I think he deserves, you know, us mentioning this. You know, you mentioned that this was the real achievement, this universality. And I mean, it wasn't just a machine to do a typing, can't do this and that. It was even within computation. Right? In his time, people didn't know this. They're like, well, what if I have a machine that just has a separate read tape and a separate write tape? I don't know. Well, how about if we add 2 write tapes? Does that make it more powerful? What if it's read write? What if it's just a stack? What if it's lambda calculus? What if it's there were so many myriad of, you know, lag systems, blah blah blah. All these different computational models. Right? And nobody knew that they were all equivalent. And that was the real, you know, remarkable No. Very I mean and to be fair, know, Turing wasn't the only 1 doing things like this. And and precisely, now we know that that all these things are equivalent and then extensions on that power. But here's actually a really important point, right? The question that has been on my mind for decades is this, a Turing machine is a model of deduction. It's universal deduction. What we're missing to be able to do what the universe does and evolution does is universal induction. What is the Turing machine equivalent for induction for learning? That's what I'm after. Right? That's what the master algorithm is. And I know it exists and again, just as you can have 1000000 different versions of Turing machines that are all equivalent, you can have 1000000 different versions of the master algorithm that are all equivalent, and that's okay. The point is that first we have to realize that there is 1, we have to prove what it does, and then we can refine it with the syntactic sugars and whatnot, and that's all good. But the main point is having, you know, gotten the universal induction machine, which I think we are we're pretty close to. But Pedro, I know the answer. It's Bayesian tensor logic. No. I'm just kidding.…

Stored transcript either side of the excerpt. The highlighted words are the published quote; the surrounding text is unedited source, never generated.

Search evidence