What is a Formal Language? Decision Problems and Discussion [Theory of Computing]
Today we cover a core concept in theory of computation called a formal language. We see its connection to problems, namely decision problems. Finally, we have a discussion about one way we can discuss these concepts at a higher level, instead of just over binary strings (in a way we would these days in Algorithms). A discussion about the "big picture".
Time Stamps:
0:00 What is a (formal) language? Examples.
10:05 Correspondence between Decision Problems and Languages. Full Example.
30:15 Discussion about how we can adopt this model at a higher level for decision problems (in algorithms). A step back to see the "big picture".
52:36 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#Algorithms
#theoryofcomputation