_index.org

cs124

Last edited: August 8, 2025

CS154 Final Summary

Last edited: August 8, 2025

Finite Automata

Deterministic Finite Automata, computability (in particular regular languages) and Non-deterministic Finite Automata (i.e. verified guessing)

optimization and Learning DFA

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, 2025

current

Last edited: August 8, 2025

current 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!