LAMBDA: PURE AND SIMPLE EXPLANATION!

In this Blog, you stay informed about things you don’t know and things you already know. In today’s post, I decided to address, as previously promised, Lambda Logic. Since 1930, Alonzo Church introduced lambda calculus at Princeton University as part of his research on the foundations of mathematics. But what do I need to know about this? You need to know that this was a revolution in computational calculations, and for this reason, I attribute to the term Lambda more than just a simple calculation relation — it is a Fully Consistent Logic.

This logic is a universal model of computation. The elementary concepts involve Function Abstraction, Application (both cases involving Functions), and Reduction (in the case of variables). These are elementary points of Church’s logic, but how can it be explained in practice in a simple way for anyone to understand?

We can say that Lambda Logic involves what we call the Forgetting Factor, Exchange, or Temporary Substitution. Imagine the following scenario: you have 2 dogs, 1 of them goes out for a walk on the street, so the expression that represents this argument (which involves Application) is: D = 1 + Lambda, where D is Dogs, 1 represents the dog that is at your house, and Lambda represents the value of the dog that went for a walk. That is, you don’t stop having 2 dogs, because in the scenario in question, the dog that went for a walk returns home. However, temporarily, it is possible to say that there was a Forgetting Factor in the computation of the data. The Lambda Condition makes it possible to calculate that instead of saying “I have two dogs,” the argument becomes “I have two dogs, but I only see one.” This is what can be called logical coating — a concept, a way of interpreting numbers, arguments, functions, and variables.

This is because, if the dog that went for a walk never comes back, then you can no longer say that “I have two dogs,” and even less can you affirm, according to Lambda, the moment when this adventurous dog stopped returning. So it is not possible to compute, without Lambda Logic, the points of precision of the events.

So, when you leave home and lose your cell phone, at the moment you remember that you lost your cell phone and can’t find it anymore, know that in the moment prior to this, any calculation involves Lambda Logic — and who knows, maybe it’s possible to find it, which wouldn’t be bad at all, right?

Any doubts about Lambda Logic? Do you think the topic was poorly explained? Comment, if you don’t forget, any opinion you might present — before you forget — which is when Lambda is not considered 100% in Logic.