Видео

This is literally what I exactly needed. Concise, super clear, clean explanations and illustrations. Just a big congratulations and Thank you for building this video

Step 1. Continue as usual till the messenger comes back the second time. Step 2. Ignore it. This will make the messenger think the Man in the Middle attack opening the lock. But your lock is still here. Step 3. Let the neighbor add in his lock. Step 4.When the messenger adds another lock and comes back, call your neighbour to tell that the messenger is tricking you into opening it. Step 5. Repeat Step 1 and 2 but when the messenger opens it's lock, the neighbor's lock is still there. Step 6. The messenger will go to your neighbor, and then the neighbor will open the lock and read the secret message.

doesn't "giving opposite program itself as input" produce infinite recursion or something?

Great vid!

❤❤❤❤❤

Really nice video! I could watch animations of values getting inserted and deleted on binary trees all day.

The earth hemisphere problem as you state it is wrong. You said pick 5 points at random. If it’s random, the points could end up in the same continent or even the same square mile. They would all end up in the same hemisphere. Like rolling dice at random, each number is as likely as any other even the same number coming up 100x in a row.

Early in your development you must study machine code, assembly language, if you want to assess the actual processor cost of architecture choices, such as designing search trees. This is an excellent presentation, but in reality there are many essential layers below what is discussed here.

We learned 2 concepts in this video. Thank you so much. I am a software engineer who did not graduated from CS. Your videos are great!

What about a program that will tell whether Halt can do work properly or not.

Thank you for an amazing explanation regarding logic gates.

Ahhh probability this one

This is a really great explanation.

I think the reason for the binary tree is the structure of CPUs.

i came here because of scrap mechanic

U are a legend! Keep doing good work

Greaty video! Presented well and easy to understand. :)

Searching goes into some problematic "feature" of modern processors - the branch misprediction penalty, most of the processors do not have optimizations to reduce that to acceptable minimum. The penalty become a huge limitation when your purpose is to achieve millions of operations per seconds.

looks like cell split

actually, the "walk" program will stop eventually given -1 as input, due to integer overflow.

This videos is soooo good.

Cool video! What do you use to make the animations by the way? They remind me of three.js renders

Also how to share wives

Nah why am I still confused? The program that we assumed will tell whether a program halts or not is doing is job. And so is the opposite program. Both are doing their jobs correctly. I only see a contradiction in the wording, not the actual job. In other words, let's say the program, instead of doing the opposite, does exactly what the halting program does. There is no contradiction there, is there?

The chances in getting such a pattern would be 1/7^69,600

All of this just to say good morning!? I'd go back to bed at that point

very nice video, love it ♥

Excellenct video

Well explained, thanks a lot

Thanks!

It might be more interesting to do this in the real world without mod functions, as in actually exchange a physical key

He sounds like Brian from cs50x

You are cooked.

My first Electrical Engineering job out of college was at a large company with a three initial name. We had an annual “confidential” Employee Satisfaction Survey. They’d find the thing “people wanted changed most” and make it a priority. It’s easiest to describe the failure of this pathetic attempt at pandering with a real example. Real Question: What would you most like to see? A. A raise B. More parking C. More vacation Somewhere around half picked A and half picked C. Not a single person at the facility chose B. But 50/50 A/C somehow, kinda maybe, averages to B. So they expanded the parking lot. Oh, and your manager was likely to discuss your answers to the “confidential” survey with you.

The power of concensus, good old anarchy ♡

I don't like this. Just add nodes by layers.

sooo cool!!!

every other video explaining B trees must be deleted to save space and time. This is perfect explanation.

Dont forget that even though halting problem in *general* is not solvable, this contradiction only applies to this particular case. Other practical cases may be solvable.

Phenomenal teaching! please do more computer programming related concepts, love this!

Really useful

en passant spotted

amazing video. wish we could have this for litterally everything.

I didn't even completed minute of the video yet, i've subscribed the channel.

Thanks for making the explanation so simple. Would you make another vid that explians how quantum computing can break this? And any solution post-quantum?

Nice video. Think you can greatly improve audio with some sound deadening 😁

PLs make more simple algorithms

Huh, I knew and studied this, technically, but this made it less "black magic" where the math was concerned. Thanks!

If it's a Secret why would you want to share it. if you do it is no longer a secret.

I loved it ❤