Mt. Gox Updated +Created
The first Bitcoin exchange. Coded as a hack, and they didn't manage to fix the hacks as the site evolved in a major way, which led to massive hacks.
Their creation is clearly visible on the archive history of bitcoin.org: web.archive.org/web/20100701000000*/bitcoin.org which started having massively more archives since Mt. Gox opened.
Video 1.
One Mistake Brought Down This FBI Most Wanted Hacker by Crumb (2023)
Source. Good overview of Mt. Gox.
One parameter subgroup Updated +Created
The one parameter subgroup of a Lie group for a given element of its Lie algebra is a subgroup of given by:
Intuitively, is a direction, and is how far we move along a given direction. This intuition is especially vivid in for example in the case of the Lie algebra of , the rotation group.
One parameter subgroups can be seen as the continuous analogue to the cycle of an element of a group.
Piezoelectric motor Updated +Created
Softcover (LaTeX) Updated +Created
LaTeX subset that output nicely to HTML.
Too insane though due to LaTeX roots, better just move to newer HTML-first markups like OurBigBook Markup or markdown.
You can learn more from older students than from faculty Updated +Created
Wikipedia mentions quoting his Nobel Prize biography:
In Monod's studies he discovered that the course work was decades behind the current biological science. He learned from other students a little older than himself, rather than from the faculty.
Cell (journal) Updated +Created
Cyc Updated +Created
FTX Updated +Created
Imperial College London Updated +Created
Nice, nice place. Natural sciences only, no bullshit.
ITER Updated +Created
LevelDB Updated +Created
One "LevelDB" database contains multiple file in a directory. Off the bat inferior to SQLite which stores everything in a single file!
Lysergic acid diethylamide Updated +Created
The best technology YouTube channels Updated +Created
Undecidable problem Updated +Created
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.
University of Cambridge Updated +Created
Library classification Updated +Created
Library of Alexandria Updated +Created
License Updated +Created

There are unlisted articles, also show them or only show them.