Great video <3

Thank you, that was easy to follow !

I escaped the secret (why you should run away)

College ❌️ KZfaq ✅️

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.

kzfaq.infoV8QD98eONCw?si=oPkUsUPHVdfzDKaG This is way too helpful

Fake comments. Nt at all helpful

* for a digital classical computer

really easy to understand. You guys are great, thank you

5:55 I create new bloom filter for deleted items, and I look for deleted BF if it is negative, I assume item is not deleted yet

You are not analysing democratic voting. A democratic voting system would require a veto option on the ballot. If a majority choose to veto, the election is re-run. In a pr system % veto = % empty seats. What you are analysing is an elected oligarchic system. Where we choose rulers, not representatives.

its always fun to watch ur explaination

Great Video!!!

Subscribing because the robots are cute 😂

why no a Star? :(

Very interesting

Hey I love Scratch :D

What about watchdog timer?

Might be a bit simplistic but would like to request a video on hole punching (networking). Maybe if combined with some other networking concept it could be a bit more viable. Thank you

Boring

Simple-but great!🎉🎉🎉🎉🎉😂😂😂😂😊😊😊😊😊

:/

4:13 if there is a carry input, then there would be a carry output but 4:19 there is no carry input but why it still propagate a carry?

You have no clue how helpful this is, and how extremely useful it is for what I work on. Thanks!

This was excellent!

If program opposite runs on the input the of its own output how will it create an output to begin with. The program that says feed program opposite its own output is broken this says nothing about program halt. A working halt program would tell you program opposite fed its own input a non halting program

DNS is the flaw 😅

good material

3⁴ = 8x3?

ceid moment

Great job!

Ok but how do you decrypt it?

One usually uses their own left vs right, as opposed to the tree's.

thanks it was helpful

Best explanation out there! Came here after watching several videos on the matter. This was the best by far. Thanks!

I feel like this would also be a good moment to make a video about the euler phi function since it massively simplifies such calculations

Thank you little bros

This is a great explanation! I wish I had this when I was taking my cryptography class last year

you should also include the code slowly building as you explain each aspect of the algorithm steps.

Is this a follow up to the three pass protocol video?

Is there a difference between using 1 hash function that maps to a space N^3 (say 1,000,000,000) and using 3 hash functions that map to space N (say 1,000)?