Once I heard neurons described as “salty bananas” because of their concentrations of K+, Na+, and Cl- ions.

Therefore, Gatorade is made of neurons.

If you don’t want a “same all the time” sync, and only want one-time transfer, use KDE Connect.

You’re in luck, it’s a designated neutral editor

Bob, short for Blob

They use a hardware memory interposer to pull off the attack.

If the attacker (A) has physical access, and (B) is using lab equipment on the target machines, then you’re already pwned.

2.1 is the most common version, but it’s way out of date. The current standardized version is 9.6.0.

Saved you a click:

1. Trypophobia, fear of clustered holes
2. Arachibutyrophobia, fear of peanut butter sticking to the roof of your mouth
3. Hippopotomonstrosesquippedaliophobia, fear of looooooooong words
4. Automatonophobia, fear of robots, mannequins, artificial humanoids
5. Xanthophobia, fear of the color yellow
6. Globophobia, fear of balloons
7. Nomophobia, fear of not having service on your phone, or being disconnected from the internet

You think these were randomly selected?

Polynomial works fine.

Exponential, runs into problem 2 that I brought up.

The digit in the ones place will always equal 1

So 01, 02, 03, 04, 05… 09, 0A, 0B, 0C, 0D, 0E, 0F… will never exceed 1.

(I thought that the polynomial problem (1 in any place will always equal 1) would be worse, but it turns out the opposite is true.)

Fixed exponential count:
1, 10, 11, 20, 21, 111, 120, 30, 200, 201

Or, in the trivial^^2 case for exponential, you could just put a 1 in the highest place and put a bunch of 0s after it.
1, 10, 100, 1000, 10000…

I like to mix Open Cola and RC Cola, it’s called OpenRC

Wabby wabby wabba wabbo wabba wa ba bop?

Relevant XKCD

PVD stands for Place Value Decimal, which is the ordinary system we use every day. Did you mix something up? fixed, no need to keep this comment up

That only works in the polynomial one, and it is very trivial. Like trival^^2 (tetration).

I almost added a challenge to it, which was this:

Try to find the smallest number of symbols where you could represent any integer!

until I realized you could just use all 1s in the polynomial system, like you mentioned.

Yes, that’s the main problem with this, how numbers with different digits can be equal. It wasn’t intended for anything serious though, just a fun thought experiment.

I didn’t come up with this entirely on my own. I encountered a number system on Everything2 or Reddit, and it was described as a “prime-factorization based number system” IIRC; but it was much more complicated than this and I can’t remember how it works.

This isn’t binary. Binary is just an ordinary place-value system with base 2 instead of base 10.

Here’s a TLDR of my post:

Let d be any digit in a number, and n be its position.
Ordinary number systems have a base B, and each digit is equal to d * Bⁿ. Common values for B are 10, 16, 8, 2 and 12.
In my invented polynomial number system, each digit is equal to dⁿ.
In my invented exponential number system, each digit is equal to n^d.

Dino would be the fermionic superpartner of a D boson, with analogy to the gauge bosons.

W boson; superpartner is Wino

Z boson; superpartner is Zino

Queen slays you!

Looks like a gremlin

It seems I can’t boot from USB on this machine. The drive is recognized in the BIOS, but even when I add it to the sequence, it always boots from the main SSD. If I disable all options except the USB, it says “No bootable device found”. When I start GRUB on my main drive, the USB doesn’t show up.

This is KDE, there are always dragons