=== ANCHOR POEM ===
═════════════════════════════════════════════════════──────────────────────────────
@user-246
One of those is a symbolic manipulation, the other is arithmetical. And
symbolic manipulations are limited only by the symbols you use to express
them, while arithmetic is grounded in logic.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════─────────────────────────────┘
=== SIMILARITY RANKED ===
--- #1 fediverse_boost/4174 ---
◀─╔═══════════════════════[BOOST]═════════════════════════───────────────────────╗
║ ┌────────────────────────────────────────────────────────────────────────────┐ ║
║ │ the belief that the world consists of discrete 'objects', rather than regarding it as an undifferentiated field of matter to which we can attach various framings, is a widespread mental limitation │ ║
║ └────────────────────────────────────────────────────────────────────────────┘ ║
╠─────────┐ ┌───────────╣
║ similar │ chronological │ different ║
╚═════════╧═════════════════════════════════════════════───────────────┴───────╝─▶
--- #2 messages/111 ---
═════════════════════════════════════════════──────────────────────────────────────
When someone remakes content into a different expression like a remake or
reboot or whatever it gives a different message in its meaning - some
circumstances and characters can apply for more than one message I'm it's
meaning
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
--- #3 messages/329 ---
═══════════════════════════════════════════════════────────────────────────────────
LLM training data that's been encrypted in such a way that it preserves
symantic meaning, while also allowing for secrecy and unique customization
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════───────────────────────────────┘
--- #4 fediverse/5719 ---
═══════════════════════════════════════════════════════════════════════────────────
I love dispatch tables! which is a term I just learned and a concept I have
been using for a while.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════════════════───────────┘
--- #5 messages/891 ---
════════════════════════════════════════════════════════════════════───────────────
AI is worth less if it can't learn what a human can with the same amount of
facts as a human.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════════════════════════════──────────────┘
--- #6 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 │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
--- #7 fediverse/2541 ---
══════════════════════════════════════════════════════─────────────────────────────
rhythm and rhyme are meant to be abused. be creative and it won't matter.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
--- #8 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 │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
--- #9 messages/662 ---
════════════════════════════════════════════════════════════───────────────────────
The trolley problem, but you're strapped to the track, and pulling the lever
means working hard for months on end.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════════════════════──────────────────────┘
--- #10 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 │
╘═════════╧╧════════════════════════════════════════════════════───────────────────────┘
--- #11 fediverse/3082 ---
═══════════════════════════════════════════════════════────────────────────────────
┌─────────────────────────────────────┐
│ CW: states-mentioned-climate-change │
└─────────────────────────────────────┘
the government doesn't want you using solar panels because then the coal and
gas infrastructure won't be able to consume coal and gas, and everyone knows
that using resources as fast as possible is surely the best and most
productive use of our state's time
like, subsidies exist. they could just... make it cheaper, but instead they're
stuck doing... nothing of value
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════───────────────────────────┘
--- #12 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 │
╘═════════╧╧═══════════════════════════════════════════════════════════════════════════┘
--- #13 fediverse/2774 ---
══════════════════════════════════════════════════════─────────────────────────────
I want to emphasize that my mask is just as much a part of me as the other
part.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
--- #14 fediverse/498 ---
═════════════════════════════════════════════──────────────────────────────────────
Wikipedia would make a lot more sense to me if they included pictures next to
the names of every proper noun so that my pictorally oriented primate brain
might pattern match meaning onto the visual understandings gleaned from the
perceptual conceiving which were arrayed within and alongside the textual
information presented to me.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
--- #15 fediverse/1810 ---
═════════════════════════════════════════════════════──────────────────────────────
some people hear words like "datastructures" and "object-oriented programming"
and think they're made up terms that don't mean anything important.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════─────────────────────────────┘
--- #16 fediverse/2786 ---
══════════════════════════════════════════════════════─────────────────────────────
the best way, I find, to be deserving of trust is to do the best that you can,
and be honest when you cannot do more.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
--- #17 fediverse/3246 ---
═══════════════════════════════════════════════════════────────────────────────────
the computer, fundamentally, cannot know who is logged into it.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════───────────────────────────┘
--- #18 fediverse/5442 ---
══════════════════════════════════════════════════════════════════════─────────────
@user-1839
the trick is to just make it and point people toward it as if it's supposed to
be there.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════════════════════────────────┘
--- #19 fediverse/3123 ---
═══════════════════════════════════════════════════════────────────────────────────
using linux requires constant maintenance and that's kind of unfair, actually.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════───────────────────────────┘
--- #20 messages/488 ---
═══════════════════════════════════════════════════════────────────────────────────
Look at the unique patterns in a programming language, and you will find
within them a usecase.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════───────────────────────────┘
|