Tim Scarfe: belief

Transcript context

…Well, thank thank you. Well, let's see let's see if I fail, when I fail. We were talking about semantics earlier. So I I think you've done some work basically proving that semantic censorship for language is is impossible and you related it to the halting problem. Yeah. I I think this is a theoretical result, though. I I, like, I I think all of this Turing machine magic is, like, this is a theoretical exercise. Some of the things that clearly, like, in the limit are impossible, but I have to say that I think models, especially modern models, change fundamentals of computing quite a bit because, like, when we think about, like, holding problem style problems, like, being able to tell whether, you know, like, a given program completes, I think it kinda doesn't really work in general in generality. Like, it's impossible. But then because today, we kinda control what programs we write. Like, if you can't reason about this program, just rewrite this. Like, change the semantics. Write it in a slightly different way. Reduce the amount of operations. Reduce the just overall length of your program. And suddenly, you're capable of reasoning a lot more about this. So basically, what I'm trying to say is I think we have a lot more scope today to reason about computers. And a lot of things that previously seemed impossible, maybe now are possible. So yesterday, if you have ever seen a c l 4 do you know what secure extension l 4 kernel? This is like a fully human verified kernel that there is no memory exploits at all existing inside. Right?…

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