_index.org

New Deal

Last edited: August 8, 2025

A set of policy by Franklin D. Roosevelt (FDR) which helped saving the economy during the Great Depression.

  • Saving the Banks
  • Unemployment Relief
  • Industrial Recovery
  • Agriculture

Creates the WPA. Also the Social Security Administration. Also created Rural Electrification Administration

Many people were still left out.

New Right

Last edited: August 8, 2025

A reformist, counterculture movement during the ’80s lead by Ronald Reagan. Its a new response to the neoliberalism which aligned the blocks of Evangelical Christians (25% of voters) and Business leaders (powerful leaders.)

American liberalism expands under the new right as well.

President as a party leader: Reagan is often shown as shining beaken of the Republican Party Leadership—won every single state except Georgia .

Newton's First Law of Motion

Last edited: August 8, 2025

\begin{equation} y’’=0 \end{equation}

that is, if \(F=0\), then the solution will travel along a straight line.

Newton's Law of Cooling

Last edited: August 8, 2025

Putting something with a different temperature in a space with a constant temperature. The assumption underlying here is that the overall room temperature stays constant (i.e. the thing that’s cooling is so small that it doesn’t hurt room temperature).

\begin{equation} y’(t) = -k(y-T_0) \end{equation}

where, \(T_0\) is the initial temperature.

The intuition of this modeling is that there is some \(T_0\), which as the temperature \(y\) of your object gets closer to t. The result we obtain

NL

Last edited: August 8, 2025

\begin{equation} \text{NL} = \text{NSPACE} \qty( \log n) \end{equation}

See also Certificates-Based Intepretation of NL

problems in \(NL\)

We can see \(L \subseteq NL\), because a TM is a NTM.

STCONN is in NL

On input \(\qty(G, s,t)\), if \(s = t\), accept; otherwise,

  • currNode = 5
  • numSteps = 0
  • while steps <= n
    • non-deterministically choose a next node
    • update currNode = w
    • if w = t, accept
    • set numSteps ++
  • reject

so we just have to remember the current node. So this whole thing is \(O\qty(\log n)\).