SQL

SELECT girl
FROM internet
WHERE age > 18
  AND age < 20
ORDER BY beauty
LIMIT 1,10

Get out now, grannyfucker.

>>2
Shut your fucking face, uncle fucker.

Don't be silly, there are no girls on the internet.

>>3
I do not normally fuck my uncles because I am not a faggot.

I fucked your uncle and took a shit on your sister¹.

-
References:
1. http://www.mdickie.com/products.htm

(0 rows)

this thread is hillarious .
kill everyone in it .

you want to find the girl of the 2nd through 11th ugliest 19-year-old internets

>>9
Yeah, it's funny nobody noticed.

pronounced 'schquill'.

>>11
siquilu

>>10
I did, but I thought it was offset 10, guess it's back to databases 101 for me

>>6
http://www.mdickie.com/images/photos/ref_telegraph.JPG
Every time I see something new on this MDickie character it makes me laugh more. This may be the best pull quote I've ever seen in my life.

>>14
I want to see a video of this faggot.  I bet M. Dickie has the most annoying geeky voice and comes off as as much of an arrogant idiot as he does in his website.

>>14
Oh shit, he's real!? I thought it was all an elaborate troll.

"Being solely responsible for the games is a creative goldmine, because there is nobody to dilute my vision or question my beliefs."

This is honestly the worst piece of shit game developer ever. I can't even *imagine* working with someone so incapable of accepting constructive criticism or creative input. Having worked as a game developer for a view years, I can tell you that this attitude definitely does not work in any development environment.

It's actually quite comforting that the article says his business "could easily make [him] a millionaire", as in, he's not a millionaire. Since he hasn't done anything but flash and a book lately, he's probably had to go get a real job like the rest of us, because if he had a million bucks he could easily fund his own one-man studio.

Ahh, the world makes sense again.

>>17
s/view/few/

>>16
Fuck I wish.
This bastard quotes himself.

>>19
That's how you know he's very successful!

Matt Dickie's so fucking cute and sweet. I'd treat him to some fancy restaurant, than take a long romantic walk with him, holding hands and talking about development, creativity and social reclusion. Then I'd invite him to my home and ravage him hot ass for hours, and forcing my cock up his throat so he chocked on both the throbbing cock and his own rectal juice. I'd then proceed to cum on his cute innocent face. Then. as the ultimate love gift, I'd carry him in my arms to the tub and let my piss wash away the semen and last dignity from him. I'd wisper "I love you" and give him a tender smile, and cut his throat from ear to ear with a knife. Covered in his own warm blood, he'd look straight into my very soul, forgiving, understanding. A bubble from blood and saliva would burst between his lips, then he'd die. After some additional lovemaking, I'd stuff him into a bin bag. Three weeks later, some playing children will find his mutilated and desecrated body in the forest. They will be scarred for life.

Hello, engineers. I can see that you haven't embraced my plan to replace scientists with artists yet. It's okay, take your time, I'm just a visionary and a scholar.

>>22
replace scientists with artists
no matter how many times i head this, it always makes me facepalm

>>23
Scientists ARE artists.

>>23
Don't worry, I know how you feel. I was like you, too, but then the enlightenment came. You might want to check this feeling out in one of my revolutionary games, The You Testament.

SCIENTISTS AND ARTISTS

>>14
Is that the low disk space balloon?

>>27
Yeah looks like the Mighty Dickhole was low on virtual memory

SELECT girl
FROM internet
WHERE age > 12
  AND age < 14
ORDER BY tears
LIMIT 1,10

I've studied lambda calculus like you guys said I should and I understand lambda. so now what are closures?

>>30
（　≖‿≖）

>>30
In case you're not trolling, which language's closures are we talking about?
In ML, it's just currying/partial application, which is somewhat limited, but still useful.
In Lisp, it's when you lexically "close"(define variables) over a function. For example:

(defun make-adder (n)
  #'(lambda (x)
      (+ x n)))

CL-USER> (make-adder 10)
#<CLOSURE (LAMBDA (X)) {24DD3405}>
CL-USER> (funcall * 9)
19
CL-USER> (funcall ** 10)
20
n is closed over that lambda expression which is then returned, so that lambda expression retains some local state (which may be changeable in Common Lisp or Scheme, but may not be in some more purely functional languages). Example:

(let ((counter 0))
  (defun inc-counter ()
    (incf counter))
  (defun reset-counter ()
    (setf counter 0))
  (defun get-counter ()
    counter))

CL-USER> (get-counter)
0
CL-USER> (inc-counter)
1
CL-USER> (inc-counter)
2
CL-USER> (inc-counter)
3
CL-USER> (inc-counter)
4
CL-USER> (get-counter)
4
CL-USER> (reset-counter)
0
CL-USER> (inc-counter)
1
It shows how one can implement an object in a very simple manner.

Here's an example which I remember from SICP (albeit that was in Scheme, and this code is in CL):

(defun my-cons (car cdr)
  #'(lambda (f) (funcall f car cdr)))

(defun my-car (cons)
  (funcall cons #'(lambda (car cdr) car)))

(defun my-cdr (cons)
  (funcall cons #'(lambda (car cdr) cdr)))

CL-USER> (my-cons 123 456)
#<CLOSURE (LAMBDA (F)) {245FFEA5}>
CL-USER> (my-car #<CLOSURE (LAMBDA (F)) {245FFEA5}>)
123
CL-USER> (my-cdr #<CLOSURE (LAMBDA (F)) {245FFEA5}>)
456
It shows how one can build any kind of data structure, just by using closures. (which isn't that surprising, if you consider what closures really are underneath the surface and how they're implemented)
It's kind of a nice feeling when you get this, but it's also nice being able to write all these kinds of code fluently after a while.

Oh, and forgot to mention. You can implement currying and functional composition in just a few lines of code using lexical closures in Lisp.

>>33
You mean like this?

(define-syntax curry
   (syntax-rules ()
      ((_ f a ...) (lambda args (apply f `(,a ... ,@args))))))

(define-syntax chain
   (syntax-rules ()
      ((_ arg) arg)
      ((_ f g ...) (f (chain g ...)))))

(define-syntax compose
   (syntax-rules ()
      ((_ f ...) (lambda (arg) (chain f ... arg)))))

>>36
And closures are incredibly useful even if they're not lambdas.
Now put the two together.

>>37
Closures and lambdas are incredibly useful even if they're not closures and not lambdas?

>>38
tertium datur

>>39
There is a third? What are you saying?

>>40
Now I realized that classical two valued logic is enough to prove it.

Let COL(x) mean "x is a closure or a lambda", and U(x) mean "x is useful". We all know that cloures or lambdas are useful, so the implication "∀x.COL(x) → U(x)" is trivial. If, however, x is not closure of lambda, the implication still holds, because ex falso quod libet.

>>41
I don't think you really know what you're talking about

>>42
No, really?

>>35
I'm not. I'm closing some values over a function or a lambda in those examples. In all of them, it's some values being bound over some piece of code. A lambda can exist without being a closure.

You can have lambdas without closures (which are not much use)
IHBT