Відео

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 ❤

berkat Pak Pri saya menonton video ini, terimakasih Pak Pri :)

Convole!

THE SEQUEL OF HOW TO SEND A SECRET MESSAGE

Do you really think our politicians are smart enough to pull this off? Is there any actual evidence of “agenda setters” using this strategy?

i wonder how this might map to physical storage. a large warehouse might take a few minutes to grab an item, but checking if it's the one you want might only take a few seconds.

Thanks Brian, watching this video because I'm solving a puzzle to implement xor using only and and not gates..

If you want to delete an element from the bloom filter, you have to remake the filter

❤❤

It's very concise and you learn a lot in a short time, and if you want to learn the source code, it'll be easier!

great!!♥

Thanks!

Wait why does his voice sound recognizably similar to that guy on CS50.

STOP THE MUSIC!!!!!!!!!!!!!

how can be 1+1=1🫠?

Great video <3

Thank you, that was easy to follow !

I escaped the secret (why you should run away)

College ❌️ UA-cam ✅️

Why is C still tagged as 3? Isn’t A F C = 4?

I have studied this in my class but that wasn't clear but now l understood . Thank you ♥️

Weird thing is, if you restrict the program size, like "for a program with less than 500 characters, decide if it halts" then the problem IS solvable, at least on paper: You just make a lookup table for every possible program and the answer Yes/No. The unsolvability is because we're trying to make a program that solves halting for any sized program.

This is explained so well!

What is this 😢

absolutely beautiful explanation

respect

To understand this theorem, you need to push Dijkstra aside. Gently.

Could it work if a condition is you can’t use the output to decide if something is going to loop

I watched some other videos first but ended up feeling confused since none of them explained the point of the various steps of the algorithm. Now everything makes more sense.

ua-cam.com/users/shortsV8QD98eONCw?si=oPkUsUPHVdfzDKaG This is way too helpful

Fake comments. Nt at all helpful