Ciro Santilli @cirosantilli 37

A Turing machine decider is a program that decides if one or more Turing machines halts of not.

Of course, because what we know about the halting problem, there cannot exist a single decider that decides all Turing machines.

E.g. The Busy Beaver Challenge has a set of deciders clearly published, which decide a large part of BB(5). Their proposed deciders are listed at: discuss.bbchallenge.org/c/deciders/5 and actually applied ones at: bbchallenge.org.

But there are deciders that can decide large classes of turing machines.

Many (all/most?) deciders are based on simulation of machines with arbitrary cutoff hyperparameters, e.g. the cutoff space/time of a Turing machine cycler decider.

The simplest and most obvious example is the Turing machine cycler decider

I caught and overcame a minor addiction to Cataclysm: Dark Days Ahead.

It does bring back the The Sims feeling from my teenage years, but with killer zombies added in.

I especially like going to sleep in that game, and how you need to setup a confy bed for it.

Some further comments at: Section "Cataclysm: Dark Days Ahead".

The way to quit is simple: delete your saves, then get annoyed with slowness of progressing back up, then use built-in debug/cheat menu to overcome that, then it's not fun anymore. This is a major advantage of single player open source games: addiction resistance!

Added font awesome icons. github.com/ourbigbook/ourbigbook/issues/151

Didn't manage to subset, but so be it for now: stackoverflow.com/questions/62395038/how-can-i-export-only-one-character-from-ttf-woff-file-to-avoid-load-unnecessa/71197892#71197892

TODO understand.

After something broke on the website due to SQLite vs PostgreSQL inconsistencies and took me a day to figure it out, I finally decided to update the test system so that OURBIGBOOK_POSTGRES=true npm test will run the tests on PostgreSQL.

Originally, these were being run only on SQLite, which is the major use case for OurBigBook CLI, which came before the website.

But the website runs on PostgreSQL, so it is fundamental to test things in PostgreSQL as well.

We know that superfluidity happens more easily in bosons, and so electrons joins in Cooper pairs to form bosons, making a superfluid of Cooper pairs!

Isn't that awesome!

Why. Why. Why is there no limit to how much I can help, but there is a limit to how many thanks I can get?

At most, limit it to a single answer to avoid highly publicized events, e.g. an answer being shared on Reddit. But across answers? It makes no sense.

The two ways main ways to overcome this limit are the 15 point answer accept reputation and bounties.

200 reputation per day works out 73k a year BTW.

The inaugural that predicted the Josephson effect.

Published on Physics Letters, then a new journal, before they split into Physics Letters A and Physics Letters B. True Genius: The Life and Science of John Bardeen mentions that this choice was made rather than the more prestigious Physical Review Letters because they were not yet so confident about the results.

Paywalled by Elsevier as of 2023 at: www.sciencedirect.com/science/article/abs/pii/0031916362913690

Correspond to the angular part of Laplace's equation in spherical coordinates after using separation of variables as shown at: en.wikipedia.org/wiki/Spherical_harmonics#Laplace's_spherical_harmonics

This theorem roughly states that states that for every quantum algorithm, once we reach a certain level of physical error rate small enough (where small enough is algorithm dependant), then we can perfectly error correct.

This algorithm provides the conceptual division between noisy intermediate-scale quantum era and post-NISQ.

One is reminded of Nick Leeson.

One things must be said: the root cause of all of this is the replication crisis.

This is why he managed to go on for so long.

People felt it was normal to have to try for one or two years to replicate a paper.