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.
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.
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.
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.
+DocBlob that is a fantastic suggestion.
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.
Love the content, the music, the script. Everything is carefully and well designed. Keep up with the good work!
Thanks for the feedback, I hope to produce another series like this soon
THAT ENDING
love your work, thank you
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!
stay tuned for more content soon
Very good explanation and a very nice to watch video:)
I am a computer science major, and it is so humbling to know that even the most complex algorithms have such simple roots.
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.
will pickup this question soon!
Great video! 👍
aop...sir i love your vids..i have learned so much...
pls make vid on why context free languages cant have a DFA
Shawn Blance
@Darbin Reyes The only difference between Finite and Pushdown Automata is that a pushdown automata has a memory "stack" whereas DFAs are memoryless.
The red face giving the information orally looked very sinister. Aggressive almost. What was he saying. (Also he looked like Matt Damon)
Does someone knows the source of the speech at the end?
Why is this video so spooky? lol 2spooky
Why the heartbeat? Is there a monster that will jump out at the end?
:-)
I personally chose to watch this video at 1.5 times speed.
well I chose to watch it at 1.51 times