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: [ Ссылка ]
Become a member: [ Ссылка ]
Donation (appears on streams): [ Ссылка ]
Paypal: [ Ссылка ]
Patreon: [ Ссылка ]
Discord: [ Ссылка ]
#easytheory
Youtube Live Streaming (Sundays) - subscribe for when these occur.
Social Media:
Facebook Page: [ Ссылка ]
Facebook group: [ Ссылка ]
Twitter: [ Ссылка ]
Merch:
Language Hierarchy Apparel: [ Ссылка ]
Pumping Lemma Apparel: [ Ссылка ]
If you like this content, please consider subscribing to my channel: [ Ссылка ]
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?
Теги
easy theoryeasy theory turing machinechurch turingchurch turing thesis in theory of computationchurch turing thesischurch turing thesis explained simplychurch turing thesis proofturing machine addition of two numbersturing machine addition binaryturing machine for addition of two unary numberschurch-turing thesisvariations of turing machinechurch turing thesis explainedvariations in turing machineturing machine variations
