=== ANCHOR POEM ===
═════════════════════════════════════──────────────────────────────────────────────
consider:
x = 13 / 3, what is x?
step 1: translate 13 into base 3
step 2: digit shift once to the right
step 3: store underflow as remainder
step 3: translate back to base 10
x is 4 remainder 1
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════─────────────────────────────────────────────┘
=== SIMILARITY RANKED ===
--- #1 fediverse/286 ---
════════════════════════════════════════════───────────────────────────────────────
┌──────────────────────┐
│ CW: re: mathematics │
└──────────────────────┘
@user-211 I agree! The problem is the limit as x->0 from the left and right
trend toward different infinities, meaning it's neither -infinity nor
+infinity. Which makes me think that it's the value that's exactly in the
middle, AKA zero.
Why wouldn't 1/0 be zero? Division is just inverse-multiplication, and
multiplying anything by zero is zero. Why wouldn't division use the same
rules? I don't understaaaaaand T.T
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════──────────────────────────────────────┘
--- #2 fediverse/46 ---
═════════════════════════════════════──────────────────────────────────────────────
@user-36 neat thanks
when I said 1-1 = 1/10 I meant 1/1 in decimal except the denominator is in
base 1 meaning it's represented as 10 (since 10 in base 1 equals 1 in base 10.
Or pretty much any other base.)
I'm trying to figure out why 00 is undefined. There's a lot of math notation
in that wikipedia article and I'm working through it bit by bit... I feel like
there's a bug in the code of the universe and I'm trying to understand it.
Like... why is dividing by zero undefined? That seems like a bug to me.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════─────────────────────────────────────────────┘
--- #3 fediverse/4084 ---
═══════════════════════════════════════════════════════════────────────────────────
┌──────────────────────┐
│ CW: re: -mentioned │
└──────────────────────┘
@user-1074
the more you try, the more you have to calculate, which is a problem, because
endlessly recursive calculations create infinite loops, which frankly are
impossible to compute because they defy computation! Not good, not ideal, no
thank you, not for me, no thanks, not what I'd like.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════───────────────────────┘
--- #4 fediverse/316 ---
════════════════════════════════════════════───────────────────────────────────────
┌──────────────────────┐
│ CW: mathematics │
└──────────────────────┘
ask not "what can logarithms do for you" but rather "what shape does a
logarithm make"
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════──────────────────────────────────────┘
--- #5 fediverse/572 ---
═════════════════════════════════════════════──────────────────────────────────────
Hi, I'm learning about semaphores right now and trying to explain them to a
friend. But I only sorta understand how they work - can anyone look at this
pseudocode and tell me if I'm on the right track?
![Some C pseudocode working through the semaphore design pattern. Here's the text of the pseudocode: /* no lock example */ void start_thread(int* x) { *x += 1; } int main() { int x = 0; for (1000 times){ start_thread(&x); } print(x); } /* in this case you have no idea what will print because thread A will take x and be like "ah yes it's 423" and then in the next instruction it'll be like "I'll increment this to be 424" and in the next one it'll say "okay now it's time to store 424 in the variable X" but like... there's a thousand threads all doing that at the same time, so odds are you'll have 5 that are like "ah yes this is 423 I'll set it to 424" */ /* not a good plan. Need a lock, so only one thread can use it at once. */ /* mutex example: */ void start_thread(int* x, int* x_mutex) { *x += 1; *x_mutex = 0; } int main() { int x = 0; int x_mutex = 0; for (1000 times){ while (x_mutex != 0){ } /* do nothing */ x_mutex = thread_id; start_thread(&x, &x_mutex); } print(x); } /* this should print 1000, but it's basically as slow as doing it single threaded. */ #define MAX 10 void start_thread(int* x, int* x_semaphore) { *x += 1; *x_semaphore += 1; } int main() { int x[MAX]; int x_semaphore = MAX; for (1000 times) { for (int i = 0; i < MAX; i++) { x_semaphore -= 1; start_thread(&x[i], &x_semaphore); } while (x_semaphore != MAX) { } /* do nothing */ } int value = sum(x, MAX); print(value); }](/similar-different/media/224b236a8660c34a.png "Some C pseudocode working through the semaphore design pattern. Here's the text of the pseudocode: /* no lock example */ void start_thread(int* x) { *x += 1; } int main() { int x = 0; for (1000 times){ start_thread(&x); } print(x); } /* in this case you have no idea what will print because thread A will take x and be like \"ah yes it's 423\" and then in the next instruction it'll be like \"I'll increment this to be 424\" and in the next one it'll say \"okay now it's time to store 424 in the variable X\" but like... there's a thousand threads all doing that at the same time, so odds are you'll have 5 that are like \"ah yes this is 423 I'll set it to 424\" */ /* not a good plan. Need a lock, so only one thread can use it at once. */ /* mutex example: */ void start_thread(int* x, int* x_mutex) { *x += 1; *x_mutex = 0; } int main() { int x = 0; int x_mutex = 0; for (1000 times){ while (x_mutex != 0){ } /* do nothing */ x_mutex = thread_id; start_thread(&x, &x_mutex); } print(x); } /* this should print 1000, but it's basically as slow as doing it single threaded. */ #define MAX 10 void start_thread(int* x, int* x_semaphore) { *x += 1; *x_semaphore += 1; } int main() { int x[MAX]; int x_semaphore = MAX; for (1000 times) { for (int i = 0; i < MAX; i++) { x_semaphore -= 1; start_thread(&x[i], &x_semaphore); } while (x_semaphore != MAX) { } /* do nothing */ } int value = sum(x, MAX); print(value); }")
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
--- #6 fediverse/40 ---
═════════════════════════════════════──────────────────────────────────────────────
@user-36 so what you're saying is I need to come up with an easier way to
change bases? Or at least a way to digit shift in a different base than what
you currently have. Sounds complicated.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════─────────────────────────────────────────────┘
--- #7 fediverse/303 ---
════════════════════════════════════════════───────────────────────────────────────
┌──────────────────────┐
│ CW: re: mathematics │
└──────────────────────┘
@user-211 if the 2nd dimension is i, then what would be the third? the real
number line, the complex plane, and the ____ space?
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════──────────────────────────────────────┘
--- #8 fediverse/1246 ---
═══════════════════════════════════════════════────────────────────────────────────
@user-883
hehe if I don't understand how it works it's difficult for me to use things.
My Linux friends get so exasperated with me because I'm like "cool script
gimme like 2 days to figure it out" and they're like "bro just use these
flags" and I'm like "no"
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════───────────────────────────────────┘
--- #9 fediverse/38 ---
═════════════════════════════════════──────────────────────────────────────────────
@user-36 ideally you'd convert to an arbitrary base (in this case 9) and shift
from there, but shifting two places might work. idk I haven't thought about it.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════─────────────────────────────────────────────┘
--- #10 fediverse/6269 ---
═════════════════════════════════════════════════════════════════════════════──────
what if the secret to LLM computation is to just not reduce the fractions and
keep it all in english language ram
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════════════════════════════─────┘
--- #11 fediverse/4139 ---
═══════════════════════════════════════════════════════════────────────────────────
@user-883
oh so it's one bit with 8 values, one for each color for each pixel? One bit
wouldn't be enough, unless you invented 8 sided die shaped transistors. They
probably use a byte for the image in question.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════───────────────────────┘
--- #12 messages/110 ---
═════════════════════════════════════════════──────────────────────────────────────
The best way to program computers is to organize them according to their
relations. Like, when x increases by 4 then y increases by 2 - basically, a
math equation that you can continuously solve by calculating more and more
comprehensively and deeply.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
--- #13 fediverse/3124 ---
═══════════════════════════════════════════════════════────────────────────────────
I should not have to follow 16 steps that I don't understand just because you
decided my system wasn't good enough for me.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════───────────────────────────┘
--- #14 fediverse/5247 ---
════════════════════════════════════════════════════════════════════───────────────
the hardest problem in computer science is figuring out why users do what they
do.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════════════════════════════──────────────┘
--- #15 fediverse/276 ---
════════════════════════════════════════════───────────────────────────────────────
┌──────────────────────┐
│ CW: mathematics │
└──────────────────────┘
why the heck would -11/2 be defined but 1/0 not be? seems kinda sus to me.
maybe it's just... not reducible, the same way that 5+i isn't?
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════──────────────────────────────────────┘
--- #16 fediverse/3635 ---
════════════════════════════════════════════════════════───────────────────────────
┌─────────────────────────────┐
│ CW: politics-housing-crisis │
└─────────────────────────────┘
if you want to solve EVERY housing issue in the United States, at least in the
short and mid-term, add a ramping tax penalty for unoccupied houses that
doesn't reset to 0 upon being occupied but rather starts ticking down at the
same rate that it increases.
Something like 0.5% to 1% of the property value for every month it's gone
unoccupied as a primary residence.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════════════════──────────────────────────┘
--- #17 fediverse/6437 ---
══════════════════════════════════════════════════════════════════════════════─────
if I was writing a programming language, I'd name it C just to fuck with people
(great, now others can decide how it's known)
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════════════════════════════────┘
--- #18 fediverse/2622 ---
══════════════════════════════════════════════════════─────────────────────────────
what kind of linux user are you if you don't even like reading terminal
output? it's USEFUL and INTERESTING information!
WHY ELSE WOULD THE PROGRAMMER OUTPUT IT???
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
--- #19 notes/star-realms-balancing-tradeoff=2 ---
══════════════════════════════════════════════════════════════════════════════════─
what if I use equal signs instead of dashes, so prevent people from assuming
they're duplicates?
hmm okay.
right so anyway the star realms balancing tradeoff between combat and authority
is measured against the duration of a hand (does it fit balanced between other
cards of it's playcost) instead of balancing it for the duration of the game
(how long does the player want the game to go on for) one of which is just
inverse combat damage / healing, and the other of which is an enablement of
different strategems.
put this in symbeline-gen-realms please
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════════════════════════════════┘
--- #20 fediverse/581 ---
═════════════════════════════════════════════──────────────────────────────────────
@user-428
sometimes I think about how much more productive I'd be if I had a code editor
that let me draw arrows and smiley faces and such alongside the code. Or if I
could position things strangely, like two functions side-by-side with boxes
drawn around them. Or diagrams or flowcharts or graphs or...
something that would output to raw txt format, but would present itself as an
image that could be edited.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
|