Regular Languages and Model Theory 1: Finite Automata
Remember: you can't spell finite automaton without "tomato"
In this video I mention "Turing Complete"-ness and "Turing Machines". Video 11 ( • Regular Languages and Model Theory 11... ) talks about them some more, but simply know that nearly all modern computer programs are equivalent in the kinds of programs you can write in them. These programming languages and any other abstract system of computation that is equivalent are called "Turing Complete". "Turing Machines" are the most commonly presented such abstract system, and consist of a finite amount of easy to access memory along with an infinite tape of memory.
If you have questions or something didn't make sense to you, let me know in the comments below.
"Kernighan and Ritchie" is the book https://en.wikipedia.org/wiki/The_C_P...
The IDE is "Borland C", which you can play around with here: https://archive.org/details/msdos_bor...