Скачать с ютуб What is the Church-Turing Thesis? в хорошем качестве

What is the Church-Turing Thesis?

Here we show that the "Church-Turing thesis" is true, which essentially says that our "intuitive" notion of an algorithm is equivalent to a Turing Machine. We show this by showing that all parts of "modern" algorithms can be done by a Turing machine, namely addition, subtraction, multiplication, division, and exponentiation. All "modern" algorithms are a finite combination of any of these operators working with binary numbers. Easy Theory Website: https://www.easytheory.org Become a member:    / @easytheory   Donation (appears on streams): https://streamlabs.com/easytheory1/tip Paypal: https://paypal.me/easytheory Patreon:   / easytheory   Discord:   / discord   #easytheory Youtube Live Streaming (Sundays) - subscribe for when these occur. Social Media: Facebook Page:   / easytheory   Facebook group:   / easytheory   Twitter:   / easytheory   Merch: Language Hierarchy Apparel: https://teespring.com/language-hierar... Pumping Lemma Apparel: https://teespring.com/pumping-lemma-f... If you like this content, please consider subscribing to my channel:    / @easytheory   Gold Supporters: Micah Wood Silver Supporters: Timmy Gy ▶SEND ME THEORY QUESTIONS◀ [email protected] ▶ABOUT ME◀ I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.