emily, blinkenlight witch
there was once a motherboard form factor called AT, "Advanced Technology"
then it got replaced with ATX, "Advanced Technology Extended"
then that wasn't big enough for some motherboards and so there's also EATX, "Extended Advanced Technology Extended"
computer people are so good at naming things
lainy
feld
emily, blinkenlight witch
the reason I was looking at motherboard form factors is because I'm sending off a motherboard I'm not using to a friend and he'll need to find his own case for it
it's not even EATX, it turns out, it's EE-ATX
Enhanced Extended Advanced Technology Extended
Joe Groff
@emily it's longstanding intel tradition. the 8085 had the 8-bit registers A, B, C, D; the 8086 made them 16-bit AX "A extended" etc.; then the 80386 made them 32-bit EAX "extended A extended"
Akari Mekahime
@emily me at work, begging architects to use more than three letters for acronyms
emily, blinkenlight witch
@engarneering @billyjoebowers even the expansion of that one ("GNU's not Unix") is ridiculous
the defining feature of our thing is that it isn't quite the thing you wanted. we tried our best though
iAmAnEngarneer
@billyjoebowers @emily like "this is our premiere brand, the one by which we will show the world our philosophy....GNU"
Flop
billy joe bowers-🇺🇦
Better than open source project names.
enoch_exe_inc
@emily Agreed. Array, list, stack, queue, vector, zipper, buffer—they’re all pretty funky names for subtly different linear data structures (i.e. lists).
They don’t compare to how physicists name things, though. For instance, all the supersymmetric particles just have the letter s prefixed to it.
Haelwenn /элвэн/ :triskell:
emily, blinkenlight witch
@lain there once was a shape called AT
but it's now quite old, you'll agree
so it was extended,
embiggened, amended,
and prefixed with EEEE.
lainy
Haelwenn /элвэн/ :triskell:
feld
enoch_exe_inc
@lanodan @enoch_exe_inc @emily Oh yeah, sorting algorithms (amongst other algorithms) have funky names, too. Like heapsort. Also, what happens if we invent an even quicker sorting algorithm than quicksort? Call it “quickersort”?
Haelwenn /элвэн/ :triskell:
emily, blinkenlight witch
@enoch_exe_inc @lanodan quicksandsort (for each element, if element < previous element, remove element and toss it into the nearest quicksand)
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.