Summer of Math Exposition

Presented by 3Blue1Brown 3blue1brown

Halting Problem, Turing Machines and Artificial Neural Networks

A proof that the halting problem is undecidable for Turing machines. However, real computers are not Turing machines, and neither are theoretical Artificial Neural Networks. A thesis related to this is made at the end of the video.


Analytics

5.1 Overall score*
81 Rank
36 Votes
14 Comments

Comments

5.5
Hi ! The video was well made and I like your presentation style. However, I think the topic of the halting problem and the diagonal argument are very well known. I am not sure that your approach provides anything new to the existing videos on the topic, except the link with AI at the end which is very quick. I think you have very good presentation / narration skill, hope you'll keep making videos. Thanks for submitting your video. :)
3
Looks like a slideshow. Does not help with attention spans.
5
This is a nicely put together video! The one complaint I have though is that when you show the "automata of computer science" poster at the start, it's a bit hard to know where I should be looking.
6.5
First of all, I love the enthusiasm! It's clear that you really enjoy teaching. The only really issue I had with it was that I think Cantor's diagonal argument was not as clear as it could have been.
5
I would try to elaborate more on explanations.
4.4
The video production is great and I love the branding. However, this is not at all a niche or unique topic. There are already thousands …or milions … of videos on this topic already.
5.5
I genuinely enjoyed the first 2 minutes of this video. Your personality really shines through, and you provide a very intuitive explanation of the halting problem. Personally, I found the latter half (namely the ANNs) could have been explained by either (1) simplifying the content; or (2) presenting it at a similar level but with a bit more explanation around the details. I will say that it is hard to judge what should be the background of your typical viewer. Overall, well done!
5.5
Background music volume should be lower when you talk. Nice video but need some technical improvements.
3
The final chart gives a great overview of the halting problem. It is well designed and memorable. Unfortunately, I feel like the video itself lacks a few things. The Turing Machine is great for making visualisations that just make the entire topic so much more intuitive, e.g. by showing a diagram of the states and connections. On the side of novelty, I did not find any concept that seemed particularly new - the Halting Problem was explained (and solved) in this manner many times on the internet and (at least in my country) in high schools. As the chart was indeed very informative, you might consider giving a written entry into next year's SoME. Thanks to the author for their entry!
6.6
I think there might be a contradiction in the video. At the start you say you're only a finite state machine because the tape you were using was only of finite length. But at the end you say a living neural network works with real numbers (or at least, may do so). But that would imply that while the /tape/ still only has finite length, the /head/ has infinite states. We're not finite state machines after all! Except that I'm not sure our brains really do have infinite states. Neurons require chemical triggers, and I would guess the minimum possible trigger is a single atom or electron, which means there would be some countable number of trigger states. And ultimately, if you go down to the Planck length, at its most fundamental level the universe is not continuous. This aside (and I didn't change the score over it), the video was perfectly all right. A short, concise summary and with a charismatic presenter. Nothing significant to grumble about. A good example of what an 'exposition' video should be.
4.7
There are too much text in the screen in the same time
3.4
You're covering a very interesting topic. Unfortunately, the video uses many new concepts without first explaining them. For a new viewer who has never heard about Turing machines, states, infinite tapes, decidability etc, you would need a lot more time to introduce these concepts slowly, step by step.
9
Awesome video and great channel!
4.3
I do not like ! both complex and difficult to follow.