Ciro Santilli @cirosantilli 40

The for loop is a subcase of the while loop.

One theoretical motivation for its existence is that it has the fundamental property that we are immediately certain it will terminate, unlike while loops with arbitrary conditions.

Primitive recursive functions are the complexity class that divides those two.

The IETF was a notable one: www.nytimes.com/2021/04/13/technology/racist-computer-engineering-terms-ietf.html

Converts RNA to DNA, i.e. the inverse of transcription. Found in viruses such as Retrovirus, which includes e.g. HIV.

Cirists,

Currently, none of the crucial cross file features like \x, \Include and table of contents are working. I was waiting until the above mentioned features were done, and now I'm going to get to that.

Most important application: produce X-rays for X-ray crystallography.

Note however that the big experiments at CERN, like the Large Hadron Collider, are also synchrotrons.

List of facilities: en.wikipedia.org/wiki/List_of_synchrotron_radiation_facilities

A function that maps two sets to a third set.

Examples: square, octahedron.

Take $(0,0,0,\dots ,0)$ and flip one of 0's to $\pm 1$. Therefore has $2\times D$ vertices.

Each edge E is linked to every other edge, except it's opposite -E.

On Baidu Baike: baike.baidu.com/item/扇画/8486689

Ultimate explanation by Ciro Santilli: math.stackexchange.com/questions/776039/intuition-behind-normal-subgroups/3732426#3732426

Links group homomorphism and the quotient group via normal subgroups.

Almost always too short superficial where it matters unfortunately, as usual.

Analogous problem to the secondary structure of proteins. Likely a bit simpler due to the strong tendency for complementary pairs to bind.

And do 5 big queries instead of hundreds of smaller ones.

For example, a README.ciro document that references another document saying:needs to fetch "speed-of-light" from the ID database (previously populated e.g. by preparsing light.ciro:to decide that it should display as "Speed of light" (the title rather than the ID).

Previously, I was doing a separate fetch for each \x[] as they were needed, leading to hundreds of them at different times.

Now I refactored things so that I do very few database queries, but large ones that fetch everything during parsing. And then at render time they are all ready in cache.

This will be fundamental for the live preview on the browser, where the roundtrip to server would make it impossible