CS Probability Index
Last edited: August 8, 2025What random variable should I use?

Unit 1
core probability, axiom of probability, counting, combination, permutation, DeMorgan’s Law.
- SU-CS109 SEP272023
- SU-CS109 SEP292023
- SU-CS109 OCT022023
- SU-CS109 OCT042023
- SU-CS109 OCT062023
- SU-CS109 OCT112023
Unit 2
Unit 3
Unit 4
Beta Distribution, central limit theorem, bootstrapping
Unit 5
Apredezahe de machinas: Naive Bayes, logistic regression, deep learning
Notes
cs124
Last edited: August 8, 2025CS154 Final Summary
Last edited: August 8, 2025Finite Automata
Deterministic Finite Automata, computability (in particular regular languages) and Non-deterministic Finite Automata (i.e. verified guessing)
we were then able to characterize hardness with Streaming Algorithm and Communication Complexity
Computability Theory
turing machines, and Oracle Turing Machine, and things that are decidable vs. recognizable
through mapping reductions, we are then able to make decidability and recognizablility claims for many languages
we learned about the hierarchy of hard problems through the notion of SUPERHALT in Oracle Turing Machines
We tied mathematics and computation together, and showed Godel’s Theorem about the Limitations of Mathematics
Cultural Revolution
Last edited: August 8, 2025current
Last edited: August 8, 2025current is defined as the flow of positive charge. Specifically:
\begin{equation} I = \frac{\Delta Q}{\Delta t} \end{equation}
resistance of a wire
(if ever you come across needing to calculate the resistance of the wire from scratch)
\begin{equation} R = \rho \frac{L}{A} \end{equation}
where, \(\rho\) is the material resistivity, \(L\) the length, and \(A\) the cross-sectional area.
you rarely need to do this!
