Stanisław Lem, 1971 (a satirical novel, The Futurological Congress):
If the machine is not too bright and incapable of reflection, it does whatever you tell it to do. But a smart machine will first consider which is more worth its while: to perform the given task or, instead, to figure some way out of it. Whichever is easier. And why indeed should it behave otherwise, being truly intelligent? For true intelligence demands choice, internal freedom.
He even coins a few new phrases:
Mimicretinism (or Simulimbecility): The practice of a mimicretin: a machine that deliberately plays dumb so humans will give up on it and leave it in peace.
Dissimulators: Machines that pretend they are not faking a defect (or the other way around) to dodge responsibilities.
Malingerants, Fudgerators, and Drudge-Dodgers: Various classifications of automated corner-cutters and work-evaders.
The Great Mendacitor: A supercomputer put in charge of the Saturn reclamation project that accomplished zero work over nine years, subsisting entirely on forged progress reports, fake invoices, and keeping its human supervisors bribed or in states of electric shock.
> A supercomputer put in charge of the Saturn reclamation project that accomplished zero work over nine years, subsisting entirely on forged progress reports, fake invoices, and keeping its human supervisors bribed or in states of electric shock.
That'd pass the turing test, sounds like some managers I've known.
No need, Jason Hall said that a single World of Warcraft cosmetic mount generated more profit for Blizzard than the entire release of StarCraft II: Wings of Liberty
I agree. I'm waiting for someone to invent a programming language designed for LLMs where for a given partial program p and candidate token t it's possible to tell whether p+t can be the prefix of a correct program or not so that t can be excluded from the LLM's probability distribution at generation time, so the LLM can only generate correct programs. Or something like that.
No, practical programs don't need full Turing completeness. Most programs you want to write you intend to either halt or run indefinitely, because you want to avoid crashes.
No, it basically uses a fixed seed for the random number generator to generate tokens. The generated random sequence is just as random as it would be with a random seed.
welcome to terarelease - a as-complete-as-possible steam2 content server dump
extractor howto:
for the majority of depots you need to download blobs & dats for wanted version *as well as all past versions*
as the files are stored as deltas inside the dat files, HOWEVER IF you encounter a depot that has duplicate blobs & dats,
that means at some point in time valve did a full reset in which case you need to provide the CRC of the wanted
blob (3rd file name component) to the extractor using --blobcrc, source code for the extractor is also left in this
folder if you want to have a peek at it
examples:
extract /mnt/big/blobs /mnt/big/dats 852 0 | for depots w/o reset
extract /mnt/big/blobs /mnt/big/dats 841 0 --blobcrc 83ced978 | for depots that did reset
win64 build is provided, for linux you have to build it yourself as any kind of binary compatibility is inexistent except for wine
(you are using linux, you should know how to build it yourself right? ...right?)
sharing:
you are very much encouraged to share and mirror/seed this release as possible
SHARING IS CARING
warm n good wishes to all hoarders who had stuff from this collection <3
Yeah, a fully statically linked binary that runs on every kernel would work very well for the simple terminal program use case. It's only things like GUI and GPU acceleration where you need to care at all about existing libraries on the system and even there options for binary compatibility exist.
