HACKMEM

/prog/, you've been missing a requirement.

Wot?

(define (satori? user)
 (and (user-understands user 'HAKMEM) (user-understands user 'SICP)))
 

Needs more
(define (user-understands? user item)
 ;...
Also, predicates and with question marks.

>>1
Still haven't gotten around to reading that.

Half of HAKMEM are observations made by the same kind of people that get fascinated by IDs.

>>5's ID is made of "me", "AA" (from the AA tag), and 4U.

Wait, what is ``HAKMEM?''

>>7
Wait, what is ``GOOGLE?''

(1/3)! and (2/3)! are interexpressible.

Meh.

To exchange two variables in LISP without using a third variable:

(SETQ X (PROG2 0 Y (SETQ Y X)))

OMG OPTIMIZED!!1

>>10
Lol SETQ. Welcome to 1972!

(setf (values x y) (values y x))

Figure 3(b).  A squared rectangle found by Schroeppel using "String Handling Interpretive Translator," a string processing language written by samoson.

lawl

>>13
I lol'd.

>>8
I used Wikipedia -- but I'd still like an explanation from Anonymous!

>>15
It's pretty much what Wikipedia says. Just a bunch of stuff all together. There's math stuff, interesting problems ("Solve the game of go."), game theory stuff (like on the peg solitare game, for example), and who knows what else. It's a collection of whatever those folks were thinking about, whether that was stuff they figured out or stuff they hadn't gotten yet.

ITEM 154 (Gosper):
The myth that any given programming language is machine independent is easily exploded by computing the sum of powers of 2.
If the result loops with period = 1 with sign +, you are on a sign-magnitude machine.
If the result loops with period = 1 at -1, you are on a twos-complement machine.
If the result loops with period > 1, including the beginning, you are on a ones-complement machine.
If the result loops with period > 1, not including the beginning, your machine isn't binary -- the pattern should tell you the base.
If you run out of memory, you are on a string or Bignum system.
If arithmetic overflow is a fatal error, some fascist pig with a read-only mind is trying to enforce machine independence. But the very ability to trap overflow is machine dependent.
By this strategy, consider the universe, or, more precisely, algebra:

let X = the sum of many powers of two = ...111111
now add X to itself; X + X = ...111110
thus, 2X = X - 1 so X = -1
therefore algebra is run on a machine (the universe) which is twos-complement.

the autism dox

Gosper gets a D- for effort on that last one.

Seriously, guys.

Seriously.

You just made that shit up.

Gosper runs on twos-complement.

I'ma hangin' out with my best bud, -0. Now available in creepy NSA white from the Sperry–RAND–UNIVAC Corporation.

>>17
1. All computers, we've seen, had a finite amount of memory.
2. If we take a computer with a finite amount of memory and add one bit of memory to it, we will still get a computer with a finite amount of memory.
3. Now, by induction, all computers have finite amount of memory.
4. Universe, as a computer, has a finite amount of memory, so Universe is finite.
5. If Universe is finite, then God is also finite.
6. But God is Infinity, so Infinity is finite.

>>20
5. If Universe is finite, then God is also finite.
Oh really?

>>20
4. Universe, as a computer, has a finite amount of memory.
Oh really?

>>22
Shit, forgot my IHBT.

>>21>>22>>23
Learn to logic, poor nyasha.

>>24
Go back to whatever russian imageboard you came from, ``pidor''.

>>24
[i]Please otimize your quoting!![/i]