Ciro Santilli @cirosantilli 37

Poet, scientists and warriors all in one? Conquerors of the useless.

A wise teacher from University of São Paulo once told the class Ciro Santilli attended an anecdote about his life:It turned out that, about 10 years later, Ciro ended up following this advice, unwittingly.

Contains the first sporadic groups discovered by far: 11 and 12 in 1861, and 22, 23 and 24 in 1973. And therefore presumably the simplest! The next sporadic ones discovered were the Janko groups, only in 1965!

Each $M_n$ is a permutation group on $n$ elements. There isn't an obvious algorithmic relationship between $n$ and the actual group.

TODO initial motivation? Why did Mathieu care about k-transitive groups?

Their; k-transitive group properties seem to be the main characterization, according to Wikipedia:Looking at the classification of k-transitive groups we see that the Mathieu groups are the only families of 4 and 5 transitive groups other than symmetric groups and alternating groups. 3-transitive is not as nice, so let's just say it is the stabilizer of $M_{23}$ and be done with it.

Who needs a hackable general purpose computer, when you can buy a completely locked down computer that only runs useless programs for which you have to pay thousands of dollars to develop for, cannot run a large percentage of major titles from competitor hardware due to business deals (see also) and will inevitably reach planned obsolescence in 4 years?

By company:

XPath kind of died with the rise of CSS selectors around the beginnning of the 2010's. But that is a shame. XPath is a good standard, and was generally more powerful than CSS selectors for many many years.

This dude actually managed to convince a brain-dead British court that he was Satoshi and force a takedown of the Bitcoin whitepaper from bitcoin.org/bitcoin.pdf where it had been for many years prior: coinmarketcap.com/academy/article/bitcoin-org-ordered-to-take-down-bitcoin-whitepaper-because-of-copyright-infringement The page was updated to simply display the following Satoshi quote:

The mere thought that Satoshi would attempt to copyright takedown the Bitcoin whitepaper, and not be able to back his identidy with any cryptographic keys, makes one shrivel to the bones.

Also, kids, this is why you put a fucking license on everything you release to the public, and especially when doing so anonymously!!! A quick CC BY-SA on that paper would have prevented all this bullshit.

The existence of this outrageous fraudster has had two good effects on the world however it must be said:

Timeline:

Social media:

Interesting

Unified all previous electro-magnetism theories into one equation.

Explains the propagation of light as a wave, and matches the previously known relationship between the speed of light and electromagnetic constants.

The equations are a limit case of the more complete quantum electrodynamics, and unlike that more general theory account for the quantization of photon.

The equations are a system of partial differential equation.

The system consists of 6 unknown functions that map 4 variables: time t and the x, y and z positions in space, to a real number:and two known input functions:

Due to the conservation of charge however, those input functions have the following restriction:

Also consider the following cases:

The goal of finding $\overrightarrow{\mathbf{E}}$ and $\overrightarrow{\mathbf{B}}$ is that those fields allow us to determine the force that gets applied to a charge via the Equation "Lorentz force", and then to find the force we just need to integrate over the entire body.

Finally, now that we have defined all terms involved in the Maxwell equations, let's see the equations:

You should also review the intuitive interpretation of divergence and curl.

Asked:

On Ubuntu 23.10, under Settings > Displays, Mirror works, but "Join" does not allow to Apply with message:Works on X Window System, it is a Wayland bug.

Related:

Immediately follows e. Coli K-12 MG1655 gene thrA,

Part of E. Coli K-12 MG1655 operon thrLABC.

The trivial takes a few hours.

The easy takes a week.

And what seemed hard takes a few hours.

As "deadlines" approach, feature sets get cut down, then there are delays, and finally a feasible feature set is delivered some time after the deadline.

The only deadlines that can be met are those of tasks which have already been done but not announced.

This is of course Hofstadter's law.

On the other hand, as a colleague of Ciro once mentioned, it is also known that the time it takes for a task to be done expands without limits to match the deadline. And therefore, without deadlines, tasks will take forever and never get done.

And so, in a moment, perceiving this paradox, Ciro was enlightened.

About 50k subscribers on 2021, which feels way too little for the video quality and quantity.

Ciro Santilli believes that this channel will go very far, certainly achieving 1M subscribers in they keep it for one or two more years. Update: it didn't, as of 2024, shame.

They are Utah-based, and they do many many amazing weekend trips. They mostly drive from home to some trailhead, and then climb up and down it the entire day.

No technical rock climbing, only bouldering, but they still manage to reach many amazing places, and there is a level of danger in many of their ascents.

They also often ski down the mountains when there is snow.

The cool thing about this channel is that as the name suggests, they are not professionals, and what they do can be done by anyone without working full time on it, as long as you have adequate preparation.

These appear to be benchmarks that don't involve running anything concretely, just compiling and likely then counting gates:

Answers suggest hat you basically pick a random large odd number, and add 2 to it until your selected primality test passes.

The prime number theorem tells us that the probability that a number between 1 and $N$ is a prime number is $1/log(N)$.

Therefore, for an N-bit integer, we only have to run the test N times on average to find a prime.

Since say, A 512-bit integer is already humongous and sufficiently large, we would only need to search 512 times on average even for such sizes, and therefore the procedure scales well.

Or: how to learn X.

This pops up on Reddit every week.

That is the wrong question.

The right question is: what is the most awesome project I can do to improve the world?

Then, once you decide to try one, if that involves programming, only then learn to program to achieve that goal. And don't stop learning what's needed until you either get the thing done, or decide that it is actually not a good idea, or not possible, or that there is something else more important to be done first.

But if doesn't involve programming, then don't learn to program, and learn whatever you actually need to reach that goal instead.

Having that goal is the only way to be motivated to do something.

This is the essence of backward design.

Another very important point to keep in mind is: Section "When in doubt, choose the course that has the most experimental work".

How to decide if an ORM is decent? Just try to replicate every SQL query from nodejs/sequelize/raw/many_to_many.js on PostgreSQL and SQLite.

There is only a very finite number of possible reasonable queries on a two table many to many relationship with a join table. A decent ORM has to be able to do them all.

If it can do all those queries, then the ORM can actually do a good subset of SQL and is decent. If not, it can't, and this will make you suffer. E.g. Sequelize v5 is such an ORM that makes you suffer.

The next thing to check are transactions.

Basically, all of those come up if you try to implement a blog hello world world such as gothinkster/realworld correctly, i.e. without unnecessary inefficiencies due to your ORM on top of underlying SQL, and dealing with concurrency.

Funding: