Ciro Santilli @cirosantilli 34

English translation of papers that include the original Quantization as an Eigenvalue Problem by Schrödinger (1926).

Published on Nature at www.nature.com/articles/122990a0 and therefore still paywalled there as of 2023, it's ridiculous.

In 2024 it will fall into the public domain in the US.

A waste of time like the rest of the knowledge olympiads.

If your kids are about to starve, fine, do it.

But otherwise, Ciro Santilli will not, ever, spend his time drilling programmer competition problems to join a company, life is too short for that.

Life is too short for that. Companies must either notice that you can make amazing open source software projects or contributions, and hire you for that, or they must fuck off.

Companies must either notice that you can make amazing projects or contributions, and hire you for that, or they must fuck off.

Marc Verdiell is a human electrical engineer best known for being the creator and host of the CuriousMarc YouTube channel.

Marc made $58.4m from the sale of LightLogic, an optoelectronics company he founded, to Intel in 2001:

The last value we will likely every know for the busy beaver function! BB(6) is likely completely out of reach forever.

By 2023, it had basically been decided by the The Busy Beaver Challenge as mentioned at: discuss.bbchallenge.org/t/the-30-to-34-ctl-holdouts-from-bb-5/141, pending only further verification. It is going to be one of those highly computational proofs that will be needed to be formally verified for people to finally settle.

As that project beautifully puts it, as of 2023 prior to full resolution, this can be considered the:on the Busy beaver scale.

This section talks about solvers/simulators dedicated solving the wave equation. Of course, any serious solver will likely be able to solve a wider range of PDE, so this section contains mostly fun toys. For more serious stuff see: Section "PDE solver".

JavaScript toy solvers:

Related:

A good explanation of how this insane system came up is given at Video "History of Oxford University by Chris Day (2018)".

As if it weren't enough, there are also the 6 Halls: permanent private hall.

The colleges are controlled by its fellows, a small self-electing body of highly successful scholars, usually in the dozens per college number it seems. Each college also usually has different types of fellows, e.g. see he university college page: www.univ.ox.ac.uk/about/college-fellowships/ (archive)

The college system does has its merits though, as it instates a certain sense of Hogwarts "belonging" to a certain group, so it might help students get better support for their learning projects from older students, or through the tutoring system. Of course, all such "belonging" feelings are bad, the correct thing would be to make great online tutorials for all, and answer questions in the open. But oh well, humans are dumb.

The college you are in impacts the quality of your courses, because tutorials are per-college. As of 2023, Ciro Santilli spoke to some students of the Computer science course of the University of Oxford, and was told that in some cases where you don't have anyone who can give the tutorial, you instead get a "class", i.e. a P.h.D. student going through question sheets with no interaction in the C.S. department, rather than a deep interactive discussion over the college fire. How can this system be so broken, it is beyond belief

This functionality is somewhat related to fraternities and sororities in 2000's United States.

Founded by Craig Venter by joining up other existing institutes.

Full set of all possible special relativity symmetries:

In simple and concrete terms. Suppose you observe N particles following different trajectories in Spacetime.

There are two observers traveling at constant speed relative to each other, and so they see different trajectories for those particles:Note that the first two types of transformation are exactly the non-relativistic Galilean transformations.

The Poincare group is the set of all matrices such that such a relationship like this exists between two frames of reference.

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:

Project trying to compute BB(5) once and for all. Notably it has better presentation and organization than any other previous effort, and appears to have grouped everyone who cares about the topic as of the early 2020s.

Very cool initiative!

By 2023, they had basically decided every machine: discuss.bbchallenge.org/t/the-30-to-34-ctl-holdouts-from-bb-5/141

In June 2024 they felt that they had verified the result after a full Coq proof was published: So now onto BB(6) I guess.

TODO no IP? Sadface?

CommonMark is a good project. But its initial release method was not very nice, they first developed everything behind closed doors with the big adopters like GitHub and Stack Overflow, and only later released the thing read, thus wasting the time of people who were working on alternative in the meanwhile, e.g. github.com/karlcow/markdown-testsuite which Ciro contributed to: Ciro Santilli's minor projects.

Two ways to see it:

Ah, some of the coolest places on Earth?