ProofWiki Updated 2025-07-16
MediaWiki-based.
This appears to be the creator: github.com/externl "Joe George".
PsiQuantum founding myth Updated 2025-07-16
Once upon a time, the British Government decided to invest some 80 million into quantum computing.
Jeremy O'Brien told his peers that he had the best tech, and that he should get it all.
Some well connected peers from well known universities did not agree however, and also bid for the money, and won.
Jeremy was defeated. And pissed.
So he moved to Palo Alto and raised a total of $665 million instead as of 2021. The end.
Makes for a reasonable the old man lost his horse.
www.ft.com/content/afc27836-9383-11e9-aea1-2b1d33ac3271 British quantum computing experts leave for Silicon Valley talks a little bit about them leaving, but nothing too juicy. They were called PsiQ previously apparently.
The departure of some of the UK’s leading experts in a potentially revolutionary new field of technology will raise fresh concerns over the country’s ability to develop industrial champions in the sector.
More interestingly, the article mentions that this was party advised by early investor Hermann Hauser, who is known to be preoccupied about UK's ability to create companies. Of course, European Tower of Babel.
Psychology Updated 2025-07-16
Here we list public domain academic papers. They must be public domain in the country of origin, not just the US, which had generally less stringent timings with the 95 year after publication rule rather than life + 70, which often ends up being publication + 110/120. Once these are reached, they may be upload to Wikimedia Commons!
Publish or perish Updated 2025-07-16
2023:
One of the world’s most cited scientists, Rafael Luque, suspended without pay for 13 years
The prolific chemist, who has published a study every 37 hours this year
You can't apparently fire someone in academia!
Rafael Luque, has been suspended without pay for the next 13 years
Punched card Updated 2025-07-16
Served as both input, output and storage system in the eary days!
Video 1.
1964 IBM 029 Keypunch Card Punching Demonstration by CuriousMarc (2014)
Source.
Video 2.
Using Punch Cards by Bubbles Whiting (2016)
Source. Interview at the The Centre for Computing History.
Video 3.
Once Upon A Punched Card by IBM (1964)
Source. Goes on and on a bit too long. But cool still.
Management Updated 2025-07-16
Video 1.
DealBook Conference 2015 - Activist Investing by New York Times Events (2015)
Source. At this timestamp, Carl Icahn tells an anecdote of how he found that an entire 12-floor building of the American Car and Foundry Company which he had recently bought was not doing anything useful, and fired the entire building.
P versus NP problem Updated 2025-07-16
Interesting because of the Cook-Levin theorem: if only a single NP-complete problem were in P, then all NP-complete problems would also be P!
We all know the answer for this: either false or independent.
Program the Micro Bit in C Updated 2025-07-27
Official support is abysmal, very focused on MicroPython and their graphical UI.
The setup impossible to achieve as it requires setting up the Yotta, just like the impossible to setup Compile MicroPython code for Micro Bit locally on Ubuntu 22.04 with your own firmware setup.
So we just use github.com/lancaster-university/microbit-samples + github.com/carlosperate/docker-microbit-toolchain:
docker pull ghcr.io/carlosperate/microbit-toolchain:latest
git clone https://github.com/lancaster-university/microbit-samples
cd microbit-samples
git checkout 285f9acfb54fce2381339164b6fe5c1a7ebd39d5

# Select a sample, builds one at a time. The default one is the hello world.
cp source/examples/hello-world/* source

# Build and flash.
docker run -v $(pwd):/home --rm ghcr.io/carlosperate/microbit-toolchain:latest yotta build
cp build/bbc-microbit-classic-gcc/source/microbit-samples-combined.hex "/media/$USER/MICROBIT/"
.hex file size for the hello world was 447 kB, much better than the MicroPython hello world downloaded from the website which was about 1.8 MB!
If you try it again for a second time from a clean tree, it fails with:
warning: github rate limit for anonymous requests exceeded: you must log in
presumably because after Yotta died it started using GitHub as a registry... sad. When will people learn. Apparently we were at 5000 API calls per hour. But if you don't clean the tree, you will be just fine.
Then there are two appraoches:
Paper by Philip W. Anderson and John M. Rowell that first (?) experimentally observed the Josephson effect.
TODO understand the graphs in detail.
They used tin-oxide-lead tunnel at 1.5 K. TODO oxide of what? Why two different metals? They say that both films are 200 nm thick, so maybe it is:
   -----+------+------+-----
...  Sn | SnO2 | PbO2 | Pb  ...
   -----+------+------------
          100nm 100nm
A reconstruction of their circuit in Ciro's ASCII art circuit diagram notation TODO:
DC---R_10---X---G
There are not details of the physical construction of course. Reproducibility lol.
Prize Updated 2025-07-16
Generally, prizes that pay big lumps of money to well established individuals are a bit useless, it would be better to pay smaller sums to struggling beginners in the field, of which there are aplenty.
The most important part about prizes should not be the money, nor the recognition, but rather explaining better what the laureates did. In this, most prizes fail. Thus Ciro Santilli's project idea: Project to explain each Nobel Prize better.
Primitive recursive function Updated 2025-07-16
In intuitive terms it consists of all integer functions, possibly with multiple input arguments, that can be written only with a sequence of:
for (i = 0; i < n; i++)
and such that n does not change inside the loop body, i.e. no while loops with arbitrary conditions.
n does not have to be a constant, it may come from previous calculations. But it must not change inside the loop body.
Primitive recursive functions basically include every integer function that comes up in practice. Primitive recursive functions can have huge complexity, and it strictly contains EXPTIME. As such, they mostly only come up in foundation of mathematics contexts.
The cool thing about primitive recursive functions is that the number of iterations is always bound, so we are certain that they terminate and are therefore computable.
This also means that there are necessarily functions which are not primitive recursive, as we know that there must exist uncomputable functions, e.g. the busy beaver function.
Adding unbounded while loops of course enables us to simulate arbitrary Turing machines, and therefore increases the complexity class.
More finely, there are non-primitive total recursive functions, e.g. most famously the Ackermann function.
Pragmatism Updated 2025-07-16
The opposite of idealism.

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