Ciro Santilli @cirosantilli 35

A phase of Fe-C characterized by the low ammount of carbon.

Ciro Santilli's favorites, including album when they're more of a one hit wonder:

Integrable functions to the power $p$, usually and in this text assumed under the Lebesgue integral because: Lebesgue integral of $L^p$ is complete but Riemann isn't

An Introduction to Tensors and Group Theory for Physicists by Nadir Jeevanjee (2011) shows that this is a tensor that represents the volume of a parallelepiped.

It takes as input three vectors, and outputs one real number, the volume. And it is linear on each vector. This perfectly satisfied the definition of a tensor of order (3,0).

Given a basis $(e_i,e_j,e_k)$ and a function that return the volume of a parallelepiped given by three vectors $V(v_1,v_2,v_3)$, ${\epsilon }_{ikj}=V(e_i,e_j,e_k)$.

Most commonly refers to: exponential map.

Ciro Santilli has felt that perhaps what is missing in 2020's AGI research is:

Forcing these boundaries to be tested was one of the main design goals of Ciro's 2D reinforcement learning games.

In those games, for example:Therefore, those continuous objects would also have "magic" effects that could not be explained by "simple" "what is touching what" ideas.

Bibliography:

Uses the frequency of the hyperfine structure of caesium-133 ground state, i.e spin up vs spin down of its valence electron $6s^1$, to define the second.

International System of Units definition of the second since 1967, because this is what atomic clocks use.

TODO why does this have more energy than the hyperfine split of the hydrogen line given that it is further from the nucleus?

Why caesium hyperfine structure is used:

Based on the fact that we don't have a P algorithm for integer factorization as of 2020. But nor proof that one does not exist!

The private key is made of two randomly generated prime numbers: $p$ and $q$. How such large primes are found: how large primes are found for RSA.

The public key is made of:

Given a plaintext message m, the encrypted ciphertext version is:This operation is called modular exponentiation can be calculated efficiently with the Extended Euclidean algorithm.

The inverse operation of finding the private m from the public c, e and $n$ is however believed to be a hard problem without knowing the factors of n.

However, if we know the private p and q, we can solve the problem. As follows.

First we calculate the modular multiplicative inverse. TODO continue.

Bibliography:

The dude was brutal. Ron Maimon praises that at youtu.be/ObXbKbpkSjQ?t=944 from Video "Ron Maimon interview with Jeff Meverson (2014)".