Automata and Formal Language Theory: Behind Regular Expressions and the Chomsky Hierarchy
Categories
70 pages
Computer Science
The Full Picture of the 'P vs NP Problem' and Computational Complexity Classes: Explanation of the Millennium Prize Problem and Its Significance in Programming
The Origins of Lambda Calculus and Functional Programming: From Alonzo Church's Theory to Lisp and Haskell
Turing Machines and Computability Theory: Alan Turing's Thought Experiment and the 'Halting Problem'
Conway's Game of Life: A Cellular Automaton Where Life-Like Complexity Emerges from Simple Rules
Four Color Theorem - Can any map be colored with 4 colors?
Gödel's Incompleteness Theorems: The Mathematical Proof of 'Truths That Can Never Be Proven'
The Halting Problem: The Ultimate Program That Can Never Be Created
Robert Floyd's Cycle-Finding Algorithm (Tortoise and Hare Algorithm)
The Limits of Prime Factorization and an Explanation of Big O Notation
