home

• Study
• Gale-Shapley algorithm
• AI and machine learning are different things
• Propositions
• Combinations
• Huntington’s postulates
• IBM Applied AI
• Regular languages
• Binomial theorem
• Isomorphic Graphs
• Predicates
• Finite automata
• Equivalence relation
• UoL Comp Sci
• Big O notation
• Computational kindness
• Graphs
• Exponential functions
• Chesterton’s Fence
• Heap sort
• Relations
• Out of the Tar Pit
• Kleene’s Theorem
• Combinatorial circuits
• Digital garden
• Pseudocode
• CM1020 Discrete Mathematics
• Boolean algebra
• Binomial coefficient
• Open notes
• Verkle trees
• Turing machines
• Sets
• Recursive algorithms
• Binary search
• Talks
• Permutations
• Euclidean algorithm
• Analysis and synthesis are diametric
• Regular expressions
• Pumping lemma
• Systems engineering
• Proofs
• Binary search tree
• Rules of inference
• Computational complexity
• Merge sort
• Bayesian thinking
• Papers
• Master theorem
• Recurrence relations
• Logic
• Evergreen notes
• Bubble sort
• Thinking above the code
• Quicksort
• Logic gates
• Context-free grammar
• Functions
• Trees
• Nondeterministic Finite Automaton
• PARA method
• Propositions - if vs only if
• CM1025 Fundamentals of Computer Science
• De Morgans laws
• Insertion sort
• Open notes are not a wiki
• Logarithmic functions
• Deterministic Finite Automata
• Counting
• Algorithms
• Combinatorics