home

• Study
• AI and machine learning are different things
• Propositions
• Combinations
• Huntington’s postulates
• IBM Applied AI
• Regular languages
• Predicates
• Finite automata
• UoL Comp Sci
• Discrete Mathematics and Its Applications
• Computational kindness
• Exponential functions
• Chesterton’s Fence
• Out of the Tar Pit
• Kleene’s Theorem
• Combinatorial circuits
• Digital garden
• CM1020 Discrete Mathematics
• Boolean algebra
• Open notes
• Verkle trees
• Sets
• Talks
• Permutations
• Analysis and synthesis are diametric
• Regular expressions
• Pumping lemma
• Systems engineering
• Proofs
• Rules of inference
• Books
• Bayesian thinking
• Papers
• Evergreen notes
• Thinking above the code
• Logic gates
• Functions
• Nondeterministic Finite Automaton
• PARA method
• Propositions - if vs only if
• CM1025 Fundamentals of Computer Science
• De Morgans laws
• Open notes are not a wiki
• Logarithmic functions
• Deterministic Finite Automata
• Counting
• Combinatorics