Here we do a livestream covering everything to do with Turing Machines and Decidability. We cover Turing Machines (and their formal definition), what a "high-level" problem description is, several variants of Turing Machines (nondeterministic, multitape, etc.), the importance and truth of the Church-Turing thesis, encodings of machines, and decidability problems involving DFAs and CFGs.

Timestamps:
0:00 - Intro
7:43 - Start of topics
8:18 - Review/Motivation for a new model
12:13 - Definition of a TM
27:26 - Example of a TM
37:47 - What is a configuration, a computation and few more terms.
45:18 - Decidable language
47:18 - TM Variants
1:06:10 - More TM Variants (Multi-tape TM, Nondeterministic TM)
1:26:20 - Computation tree
1:34:25 - Can TMs do arithmetic?
1:41:15 - Church-Turing Thesis
1:44:09 - Problems for TMs ("High-level" algorithm/Encodings)
1:58:49 - Acceptance problems involving DFA, NFA, Regex, etc.
2:13:42 - "Emptiness" Problem for DFAs (E_DFA)
2:19:15 - "Equivalence" Problem for DFAs (EQ_DFA)
2:28:46 - "Acceptance" Problem (for CFGs)
2:39:14 - "Emptiness" Problem for CFGs
2:48:50 - End

Donation (appears on streams): [ Ссылка ]
Paypal: [ Ссылка ]
Patreon: [ Ссылка ]
Discord: [ Ссылка ]

#easytheory #gate #theory

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.

свернуть