Ciro Santilli @cirosantilli 37

Source code:

They are huge fans of Unicode characters! Check this out from a formal proof of the prime number theorem: github.com/AlexKontorovich/PrimeNumberTheoremAnd/blob/fbdbb5310d036d33b9797b35f3b04b08f2447a6e/PrimeNumberTheoremAnd/ZetaBounds.lean

Their dependency graph thingy is just beautiful however: alexkontorovich.github.io/PrimeNumberTheoremAnd/web/dep_graph_document.html

This is the cutest product name ever.

Used e.g. at Video "Superconducting Quantum Interference Devices by UNSW Physics (2020)"

Their manual: www.phys.ksu.edu/personal/cocke/classes/phys506/squidman.pdf

YBCO device, runs on liquid nitrogen.

.

The polynomials together with polynomial addition and multiplication form a commutative ring.

Magic: The Gathering meta-based deck choice is a bimatrix game.

The opposite of a human-readable format.

Less evil are BLOBs that come from Reproducible builds.

By William Shockley in 1948 also at Bell Labs Murray Hill.

As of 2020, not used anymore in logic gates, but still used in amplifiers.

The BSD conjecture states that if your name is long enough, it will always count as two letters on a famous conjecture.

Maybe also insert a joke about BSD Operating Systems if you're into that kind of stuff.

The conjecture states that Equation 1. "BSD conjecture" holds for every elliptic curve over the rational numbers (which is defined by its constants $a$ and $b$)

The conjecture, if true, provides a (possibly inefficient) way to calculate the rank of an elliptic curve over the rational numbers, since we can calculate the number of elements of an elliptic curve over a finite field by Schoof's algorithm in polynomial time. So it is just a matter of calculating $N_p$ like that up to some point at which we are quite certain about $r$.

The Wikipedia page of the this conecture is the perfect example of why it is not possible to teach natural sciences on Wikipedia. A million dollar problem, and the page is thoroughly incomprehensible unless you already know everything!

Centerpiece of the CEA since the beginning of the French nuclear weapons program, headquarters since 2006.

As of 2023 the place was blurred on Google Maps satellite view, no wonder.

Is a decision problem of determining if something belongs to a non-recursive language.

Or in other words: there is no Turing machine that always halts for every input with the yes/no output.

Every undecidable problem must obviously have an infinite number of "possibilities of stuff you can try": if there is only a finite number, then you can brute-force it.

Some undecidable problems are of recursively enumerable language, e.g. the halting problem.

Lists of undecidable problems.

Coolest ones besides the obvious boring halting problem:

Official Bitcoin domain registered by Satoshi Nakamoto.

Registration: 2008-08-18 by www.namecheap.com, an American company. But using a privacy oriented registrar: bitcoin.stackexchange.com/questions/89532/how-did-nakamoto-untraceably-pay-for-registering-bitcoin-org It is unknown how he could have paid anonymously, so it seems likely that the true identity could be obtained by law enforcement if needed.

First archive 2009-01-31: web.archive.org/web/20090131115053/http://bitcoin.org/ Also from the archive history web.archive.org/web/20100701000000*/bitcoin.org, things really started picking up on July 2010. This is almost certainly due to the opening of

Ciro Santilli is old enough to remember his parents whispering its name with a respectful tone.

Genius: Richard Feynman and Modern Physics by James Gleick (1994) mentions several times how Richard Feynman was a reader of the encyclopedia. E.g. in youtu.be/ivxkd98mDvc?t=50 Richard's sister also talks about it.

Then the Internet came along and killed it.

The motivation model for collaborators was simple: to get famous. To be able to be selected contribute an article meant that you knew something or two! There was some physicist Ciro read the biography of who was really glad to be able to write an article on the encyclopedia after having worshiped it for so long, TODO find the reference.

While this is somewhat a part of Wikipedia motivation, it is much less so because there is no single article authorship. This is something OurBigBook.com aims to improve.

Startup lists:

Deep tech (have labs) unicorns:

Almost deep tech but possibly without labs:

A polynomial with multiple input arguments, e.g. with two inputs $x$ and $y$:as opposed to a polynomial with a single argument e.g. one with just $x$: