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: www.easytheory.org
Become a member: / @easytheory
Donation (appears on streams): streamlabs.com/easytheory1/tip
Paypal: paypal.me/easytheory
Patreon: / easytheory
Discord: / discord
#easytheory
KZitem Live Streaming (Sundays) - subscribe for when these occur.
Social Media:
Facebook Page: / easytheory
Facebook group: / easytheory
Twitter: / easytheory
Merch:
Language Hierarchy Apparel: teespring.com/language-hierar...
Pumping Lemma Apparel: 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◀
ryan.e.dougherty@icloud.com
▶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.
Негізгі бет What is the Church-Turing Thesis?
Пікірлер: 3