What is an Algorithm?

Two essential ideas behind algorithms are explored. This is part 2 of our series on Computer Science.

[@DocBlob]

I am loving this series so far, great work! I would love to see a series based on the foundations of mathematics, I think the insight this channel has provided on the topics they have covered so far is truly institutional. A series on something like Axiomatic Set Theory / ZFC etc. would be well handled by this channel.

[@MrCmurra]

+DocBlob that is a fantastic suggestion.

[@kratanuva725]

But if you do decide to make such a series, please include some of the more modern approaches such as constructive type theory and explain the differences/relationship between that and ZFC + first order logic.

[@MattSiegel]

THAT ENDING

[@typesAreSpaces]

Love the content, the music, the script. Everything is carefully and well designed. Keep up with the good work!

[@ArtOfTheProblem]

Thanks for the feedback, I hope to produce another series like this soon

[@KoKo-xh4cd]

love your work, thank you

[@sdfasdfsdfklsdfjklsdflsdkl377]

Very good explanation and a very nice to watch video:)

[@AnantMall]

You will soon gain atleast a million subscribers i swear. Started with the encryption video and on a journey now!! Sharing with all my friends!

[@ArtOfTheProblem]

stay tuned for more content soon

[@patricklocke5996]

I am a computer science major, and it is so humbling to know that even the most complex algorithms have such simple roots.

[@3l4ck30mb3r]

Really love that video, great work! However I want to add that a 3rd question would have been interesting to add "How can we make sure the algorithm actually terminates?" :) This could create a nice transition to computability theory.

[@ArtOfTheProblem]

will pickup this question soon!

[@fwbarnes2011]

aop...sir i love your vids..i have learned so much...

[@AC_Blanco]

Great video! 👍

[@RingxWorld]

pls make vid on why context free languages cant have a DFA

[@billblance6892]

Shawn Blance

[@williamwesner4268]

@Darbin Reyes The only difference between Finite and Pushdown Automata is that a pushdown automata has a memory "stack" whereas DFAs are memoryless.

[@ZeFuReNgA]

Does someone knows the source of the speech at the end?

[@nealmceneaney3771]

The red face giving the information orally looked very sinister. Aggressive almost. What was he saying. (Also he looked like Matt Damon)

[@roguehind2842]

Why is this video so spooky? lol 2spooky

[@yagomg7790]

:-)

[@DarthAlphaTheGreat]

Why the heartbeat? Is there a monster that will jump out at the end?

[@DJBrazzyHD]

I personally chose to watch this video at 1.5 times speed.

[@Tubeytime]

well I chose to watch it at 1.51 times