Ciro Santilli @cirosantilli 37

We ust use the if mod notation definition as mentioned at: math.stackexchange.com/questions/4305972/what-exactly-is-a-collatz-like-problem/4773230#4773230

Applications:

How genes form bodies.

TODO find a concrete numerical example of doing calculus on a differentiable manifold and visualizing it. Likely start with a boring circle. That would be sweet...

www.ibiblio.org/chinese-music/html/traditional.html contains an amazing orchestral version for di flute TODO identify! When attempting to upload to YouTube, it identifies as "Su Wu Tending the Sheep" and give a name "Chen Tao", but no further information. Chen Tao is presumably this dude: www.barduschinamusic.org/chen-tao-dizi | www.melodyofdragon.org/chentao.html 陈涛

baike.baidu.com/item/苏武牧羊/5532#11_2 mentions that it comes from an erhu concerto composed by Peng Xiuwen

The sadness of the erhu perfectly fits the role and mood of the story! Brilliant!

This is a good read: quantumai.google/hardware/datasheet/weber.pdf May 14, 2021. Their topology is so weird, not just a rectangle, one wonders why! You get different error rates in different qubits, it's mad.

The main interest of this theorem is in classifying the indefinite orthogonal groups, which in turn is fundamental because the Lorentz group is an indefinite orthogonal groups, see: all indefinite orthogonal groups of matrices of equal metric signature are isomorphic.

It also tells us that a change of basis does not the alter the metric signature of a bilinear form, see matrix congruence can be seen as the change of basis of a bilinear form.

The theorem states that the number of 0, 1 and -1 in the metric signature is the same for two symmetric matrices that are congruent matrices.

For example, consider:

The eigenvalues of $A$ are $1$ and $4$, and the associated eigenvectors are:symPy code:and from the eigendecomposition of a real symmetric matrix we know that:

Now, instead of $P$, we could use $PE$, where $E$ is an arbitrary diagonal matrix of type:With this, would reach a new matrix $B$:Therefore, with this congruence, we are able to multiply the eigenvalues of $A$ by any positive number $e_1^2$ and $e_2^2$. Since we are multiplying by two arbitrary positive numbers, we cannot change the signs of the original eigenvalues, and so the metric signature is maintained, but respecting that any value can be reached.

Note that the matrix congruence relation looks a bit like the eigendecomposition of a matrix:but note that $D$ does not have to contain eigenvalues, unlike the eigendecomposition of a matrix. This is because here $S$ is not fixed to having eigenvectors in its columns.

But because the matrix is symmetric however, we could always choose $S$ to actually diagonalize as mentioned at eigendecomposition of a real symmetric matrix. Therefore, the metric signature can be seen directly from eigenvalues.

Also, because $D$ is a diagonal matrix, and thus symmetric, it must be that:

What this does represent, is a general change of basis that maintains the matrix a symmetric matrix.

Related:

Subcase of symmetric multilinear map:

Requires the two inputs $x$ and $y$ to be in the same vector space of course.

The most important example is the dot product, which is also a positive definite symmetric bilinear form.

where:

Remember that $\psi$ is a 4-vetor, gamma matrices are 4x4 matrices, so the whole thing comes down to a dot product of two 4-vectors, with a modified $\psi$ by matrix multiplication/derivatives, and the result is a scalar, as expected for a Lagrangian.

Like any other Lagrangian, you can then recover the Dirac equation, which is the corresponding equations of motion, by applying the Euler-Lagrange equation to the Lagrangian.

One of the companies that has fabs, which buys machines from companies such as ASML and puts them together in so called "silicon fabs" to make the chips

As the quintessential fabless fab, there is on thing TSMC can never ever do: sell their own design! It must forever remain a fab-only company, that will never compete with its customers. This is highlighted e.g. at youtu.be/TRZqE6H-dww?t=936 from Video "How Nvidia Won Graphics Cards by Asianometry (2021)".

Described at: arxiv.org/pdf/2107.12475.pdf where a relation to the Busy beaver scale is proven, and the intuitive relation to the Collatz conjecture described. Perhaps more directly: demonstrations.wolfram.com/CollatzSequenceComputedByATuringMachine/

Unknown real developer name, claims to be from Canada on YouTube channel about: www.youtube.com/@TheBibitesDigitalLife/about, likely because he's a software developer and wants to keep his employer's claws away from his side project.

Appears to be closed source unfortunately, so not suitable for research.

Video 1. "What will happen after 100h of evolution? by The Bibites (2022)" mentions it was started five years ago, so circa 2017.

Appears to be Unity-based, if you download and extract for Linux you get files named UnityPlayer.so.

Author is named Leo Caussan in game credits at startup: www.linkedin.com/in/l%C3%A9o-caussan-560350136/, a Canadian software engineer.

Was not very Linux compatible: www.reddit.com/r/TheBibites/comments/vqk6ac/program_stalls_at_a_blue_screen/ Trying to run 0.5.0 leads to a blank screen after you click "start simulation".

Can we do better than "wrong password implies random bytes"?

Can the last disk access times be checked via forensic methods?