What is a Formal Language? Decision Problems and Discussion [Theory of Computing]

Published on ● Video Link: https://www.youtube.com/watch?v=GM_9oae6o2Y



Duration: 0:00
133 views
5


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




Other Videos By PageWizard Games, Learning & Entertainment


2023-02-03Proving Correctness of DFAs via State Invariants II [FULL EXAMPLE 2] (Theory of Computing)
2023-02-01Ms. Kitty Disrupts Dr. Page's Lecture All Wet
2023-02-01Proving Correctness of DFAs via State Invariants [FULL EXAMPLE] (Theory of Computing)
2023-02-01Nondeterminism and Nondeterministic Finite Automata
2023-01-30Proving Correctness of Deterministic Finite Automata, State Invariants (Theory of Computing)
2023-01-27Formal Definition of Computing for DFAs (Theory of Computing)
2023-01-25Regular Operators (Theory of Computing)
2023-01-23Designing Deterministic Finite Automata (DFAs) [Theory of Computing]
2023-01-20What are Deterministic Finite Automata (DFAs)? A Conceptual Overview [Theory of Computing]
2023-01-19Dan Plays Pokemon Scarlet (January 19, 2023)
2023-01-18What is a Formal Language? Decision Problems and Discussion [Theory of Computing]
2023-01-12Dan Plays Pokemon Scarlet (January 12, 2023)
2023-01-11Combinations (k-Combinations) [Mathematics for Computer Science]
2023-01-10Deterministic Finite Automata: Regular Operators, and Proving DFAs are Correct
2023-01-09Permutations and k-Permutations (Mathematics for Computer Science)
2023-01-07Dan Plays Pokemon Scarlet (January 6, 2023)
2023-01-06Multiplication Principle, Number of Ordered Sequences with Repeats (Maths for Computer Science)
2023-01-04Addition Principle, Inclusion/Exclusion Principle (2 Sets) [Mathematics for Computer Science]
2023-01-03Strings, Formal Languages, and Deterministic Finite Automata
2023-01-02Checking Solutions to Recurrence Relations (Mathematics for Computer Science)
2022-12-30Solving Recurrence Relations via Iteration