Halting Problem, Turing Machines and Artificial Neural Networks
Автор: MathsCharts
Загружено: 2024-07-09
Просмотров: 241
Описание:
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.
This video is my entry to #SoME4, #SoMEπ, #SoMePi.
While mathematics is already being taught in visual ways, I have noticed that no one is making posters capturing at once multiple aspects. With my posters I am hoping to bridge the gap. While this poster is not yet publicly available, many of my other posters can be downloaded for free.
Music: http://www.bensound.com, Evolution and Echo Of Sadness by Benjamin Tissot
Music: https://www.bensound.com
License code: 9RREDE1CQL5KHUUW
Music by Bensound.com/free-music-for-videos
License code: QDFZH6SC8K44TMRU
00:00 Intro
00:25 What is the halting problem?
00:59 Turing Machine
01:59 Proof
04:41 Collatz Conjecture
04:58 Artificial Neural Networks
05:47 Outro
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
