Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-4041-8081-

IVE READ SICP

Name: Anonymous 2007-05-02 8:07 ID:A1TytIIg

http://i13.tinypic.com/63ijdck.jpg
NOW THAT I HAVE READ SICP I AM AN EXPERT PROGRAMMER

Name: Anonymous 2007-05-02 8:12 ID:A1TytIIg

Roses are red,
Violets are blue,
ive read SICP,
have you?

Name: Anonymous 2007-05-02 8:16 ID:OijS/EIv

>>1
>>2
Does that have anything to do with the topic, or is that just your way of saying 'I've read SICP'?

Name: Anonymous 2007-05-02 9:21 ID:EuOfee22

car = exp true
cdr = exp false

POINTFREE

Name: Anonymous 2007-05-02 12:10 ID:A1TytIIg

ONE WORD, IVE READ SICP, THREAD OVER

Name: Anonymous 2007-05-02 20:25 ID:sCppwNk5

>>5
Does that have anything to do with the topic, or is that just your way of saying "I've read SICP"?

Name: Anonymous 2007-05-02 22:14 ID:CatptRb7

Awesome

Name: Anonymous 2007-05-02 22:36 ID:A1TytIIg

IVE READ SICP ━━━( ゚∀゚ )━(∀゚ )━(゚  )━(  )━(  ゚)━( ゚∀)━( ゚∀゚ )━━━!!!!

Name: Anonymous 2007-05-03 2:25 ID:Heaven

YOU MIGHT HAVE READ SICP
BUT YOU CLEARLY HAVE NO EYE FOR VISUAL BEAUTY
CODE IS ART
THEREFORE, YOU ARE NOT AN EXPERT PROGRAMMER

Name: Anonymous 2007-05-03 2:48 ID:PQ7Rpk1A

>>9
;_;

i hope your joking
:(

Name: Anonymous 2007-05-03 3:23 ID:tT98w50p

>>9
What you say? That picture is a magnificent piece of art.

Name: Anonymous 2007-05-03 4:04 ID:PQ7Rpk1A

>>11
Hah! THANK YOU!@ (ive read sicp)

Name: Anonymous 2007-05-03 4:06 ID:hTjJxaXr

>>1
CODE HAS BEEN FORCIBLY INDENTED BY PROGRAMMING PRACTICE, THREAD OVER.

Name: Anonymous 2007-05-03 4:44 ID:PQ7Rpk1A

>>13
ONE COMPARISON, FORCIBLY BUT NOT FORCED, YOU OVER

Name: Anonymous 2007-05-03 8:33 ID:rpWfW5uU

SICP READ ME

Name: Anonymous 2007-05-03 14:22 ID:aPYoqLEx

>>12
is that even relevant to the topic or is this just your way of saying "ive read SICP"?

Name: Anonymous 2007-05-03 18:19 ID:PQ7Rpk1A

sicp?!

Name: Anonymous 2007-05-04 2:19 ID:DAu/lhKC

ONE SEGFAULT, THE FORCED ACCESS OF MEMORY, "EXPERT PROGRAMMER" OVER.

Name: Anonymous 2007-05-04 9:21 ID:+VD6NKoD

>>18
lollol

Name: Anonymous 2007-05-04 9:53 ID:1rCA1Ovu

>>18
ONE SEGFAULT, THE FORCED ACCESS OF MEMORY, THE BIRTH OF AN "EXPERT PROGRAMMER".

Name: Anonymous 2007-05-04 10:33 ID:+VD6NKoD

>>20
explain yourself, NOW.

Name: Anonymous 2007-05-04 12:09 ID:dRVX7DTH

>>21
I don't have to give reasons for anything I say, because I am an EXPERT PROGRAMMER.

Name: Anonymous 2007-05-04 12:11 ID:1rCA1Ovu

>>21
You can't claim to be an EXPERT PROGRAMMER unless all your code randomly segfaults.

Name: Anonymous 2007-05-04 12:58 ID:3sRJYHaM

>>23
sorry but EXPERT PROGRAMMERS use type safe languages and prove that thier programs terminate.

Name: Anonymous 2007-05-04 13:55 ID:HNZ1Q9Iz

>>24
sorry but TYPE SAFE LANGUAGES are not enough to prove that programs do indeed terminate. The current state of research on languages that would potentially fix that is pitiful. I've read a paper on that and it took (if I remember correctly) six pages to go to a + b. No, I don't remember the link. Use programming.reddit search.

(I'm a Haskell fag. No need to reply.)

Name: dddddddddddddddddd 2007-05-04 14:07 ID:2Xyo9Blc

WHO CARES IF IT TERMINATES?
compute_ :: Int -> String -> IO () -> IO ()
compute_ limit failmsg !computation = do
    ended       <- newQSem 0
    computation <- forkIO $ do computation
                               signalQSem ended
    reader      <- forkIO $ do threadDelay limit
                               killThread computation
                               signalQSem ended
                               fail failmsg
    waitQSem ended
    killThread reader
    killThread computation

Name: Anonymous 2007-05-04 14:13 ID:wpnu/sqG

Shut up, namefag

Name: Anonymous 2007-05-04 14:43 ID:3sRJYHaM

>>25
You can prove specific code terminates, we just have to extend the proof to anything acceptable by the type system, then any type safe program terminates!

Name: Anonymous 2007-05-04 14:49 ID:HNZ1Q9Iz

>>28
Well, yeah. You don't even need static typing for that. Plain strong typing is enough. That doesn't mean a human being could prove that for any non-trivial program using any current language.

Name: Anonymous 2007-05-04 15:15 ID:3sRJYHaM

>>29
maybe that would make more sense if you define 'trivial'

Name: Anonymous 2007-05-04 15:33 ID:HNZ1Q9Iz

>>30
Anything beyond a composition of ~two functions.

Name: Anonymous 2007-05-04 15:53 ID:wpnu/sqG

>>31
Man, sometimes I write four functions

Name: Anonymous 2007-05-06 17:38 ID:Lvkf3Pnf

ONE DISREGARD, THE SUCKING OF COCKS, NO EXCEPTION OVER.

Name: Anonymous 2007-05-06 18:03 ID:Heaven

#include <stdlib.h>
#include <time.h>
int main(){
 srand(time(0));
 while(rand()>>30)
  fork();
 return 0;
}

Name: Anonymous 2007-05-06 18:12 ID:Heaven

>>34
Stop being so fucking clever.

Name: Anonymous 2007-05-06 18:56 ID:Heaven

>>35 i lold

Name: Anonymous 2007-05-06 20:15 ID:yQavMOKM

>>34
What does >>30-san have to do with this?

Name: Anonymous 2007-05-06 21:00 ID:AC0zZ0mE

>>1
Knuth or GTFO!

Name: Anonymous 2007-05-06 21:49 ID:Heaven

>>37
>>34 is a trivial program. it's also damn near impossible to prove whether or not it terminates.

Name: Anonymous 2007-05-06 22:17 ID:wBicGWHX

>>39

Actually, the whole set of processes will terminate as long as at least one number in the random sequence seeded at the start has the highest two bits set to zero (what >‍>30 is testing.) This can be proved by examining the characteristics of rand()'s algorithm.

The reason: as the child process doesn't call srand() again, it will continue to use the same random number sequence as the parent. So they all terminate simultaneously.

Name: Anonymous 2007-05-06 22:20 ID:wBicGWHX

>>40

Or to put it another way, the program simplifies to:

#include <time.h>
int main(){
 srand(time(0));
 while(rand()>‍>30);
 return 0;
}

Name: Anonymous 2007-05-06 22:24 ID:Heaven

>>40-41
ok, then...
#include <stdlib.h>
#include <time.h>
int main(){
 srand(time(0));
 while(rand()>>30)
  fork();
  srand(time(0));
 return 0;
}

Name: Anonymous 2007-05-06 22:29 ID:Heaven

>>40-41
How do you get >>30 not to link?

Name: Anonymous 2007-05-06 22:53 ID:Heaven

>>42

{ } or GTFO

Name: Anonymous 2007-05-06 23:08 ID:Heaven

>>44
#include <stdlib.h>
#include <time.h>
int main(){
 srand(time(0));
 while(rand()>>30){
  fork();
  srand(time(0));
 }
 return 0;
}

Name: Anonymous 2007-05-07 5:33 ID:2iuUj0FP

>>40
fail
rand() returns an integer (32 bits) and there is a small chance for it to terminate or continue forever.

Name: Anonymous 2007-05-07 5:35 ID:aRbfaFVt

>>40
wrong try this test case

[forced-indentation-of-code]
bint main() {
   printf("rand = %d\n", rand());
   printf("fork = %d\n", fork());
   printf("rand = %d\n", rand());
}
[/forced-indentation-of-code]

Name: Anonymous 2007-05-07 5:35 ID:aRbfaFVt

>>47
or just read the fucking manual page...

Name: Anonymous 2007-05-07 5:55 ID:Heaven

>>48
!!!!!!!!!!
MANUALS?!
DON'T TELL ME TO READ MANUALS!
I WAS WRITING RFC's BEFORE YOU WHERE BORN MOTHERFUCKER

Name: Anonymous 2007-05-07 6:05 ID:6fdezZNj

>>49
= EXPERT PROGRAMMER MOTHERFUCKER. DO YOU USE IT?

Name: Anonymous 2007-05-07 9:50 ID:vaTgPxtC

>>47

Not wrong:

rand = 1804289383
fork = 0
rand = 846930886
fork = 21981
rand = 846930886

Name: Anonymous 2007-05-07 15:56 ID:i3M1bRwq

lulz i red sicp now i programs gud:

(require (lib "list.ss"))
(define (g n) (if (> n 11) '() (cons n (g (+ n 1)))))
(define (h n) (or (< n 4) (odd? n) (> (/ (log n) (log 3)) 2)))
(define (i n) (foldr string-append "" (map number->string (map char->integer (string->list n)))))
(define (j n) (if (equal? n "") '() (cons (substring n 0 2) (j (substring n 2 (string-length n))))))
(define (k n) (map (lambda (m) (map (lambda (o) (- (char->integer o) 48)) (string->list m))) n))
(for-each (lambda (x) (display (integer->char x))) (map (lambda (l) (+ 106 (apply * (map (lambda (x)
(list-ref (filter h (g -1)) x)) l)))) (k (j (i "ƤMôF<Į^ǂĝŴ")))))

Name: Anonymous 2007-05-07 16:41 ID:uH/OHB0I

>>52
No, that's from SPIC.

Name: Anonymous 2007-05-07 16:41 ID:uH/OHB0I

Wow, I got a marvelous ID.

Name: Anonymous 2007-05-07 17:13 ID:ZB3CD/Jy

>>52
what the fuck can I run that in

Name: Anonymous 2007-05-07 17:13 ID:Heaven

screencapped

Name: Anonymous 2007-05-07 18:17 ID:uH/OHB0I

>>56
What for?

Name: Anonymous 2007-05-07 22:29 ID:Heaven

>>57
lulz

Name: Anonymous 2007-05-08 3:52 ID:U0KKbiZc

>>55
it's written in MzScheme
To run it you would probably want to get DrScheme and set language to PLT->Graphical(MrEd)

Name: Anonymous 2007-05-08 4:00 ID:U0KKbiZc

>>59
but I wouldn't bother, it's intentionally boorish code

Name: Anonymous 2007-05-08 11:24 ID:0oGdbA/b

id like to know what it duz...

Name: Anonymous 2007-05-08 11:39 ID:DN+OW3Nt

>>46

You obviously missed the bit that said "this can be proved by examining the characteristics of rand()'s algorithm"

I.e. the problem is simplified to ensuring that at some point in any pseudo-random sequence generated by rand(), the two highest bits will be zero.

Name: Anonymous 2007-05-08 15:55 ID:CYLEaEj5

>>61
It outputs 'massachusetts
ie it's functionally equivalent to (begin (wait 10000) 'massachusetts)

Name: Anonymous 2007-05-08 16:21 ID:UP6rzukz

Rand algorithm is rand()

Name: Anonymous 2007-05-08 17:11 ID:0oGdbA/b

>>64
IF U WERE DROPPED TO /opt TOMORROW, I WOULDNT GO 2 UR DELETION CUZ ID B N UPSTREAM BUGZILLA FLAMIN DA CUNT THAT MADE UR EBUILD!
     __  
   .'  `.
   |a_a  |
   \<_)__/
   /(   )\
  |\`> < /\
  \_|=='|_/

    WE TRUE NERDS
    WE OPTIMIZE OUR CFLAGS TOGETHER
    WE TALKIN ON IRC WITH www.opera.com TOGETHER
    send this PENGUIN to every thread you care about including this one if you care. C how many times you get this, if you get 256 your A TRUE NERD

Name: Anonymous 2007-05-08 18:17 ID:hK/bu8KN

IF U WERE DROPPED TO /opt TOMORROW, I WOULDNT GO 2 UR DELETION CUZ ID B N UPSTREAM BUGZILLA FLAMIN DA CUNT THAT MADE UR EBUILD!
     __ 
   .'  `.
   |a_a  |
   \<_)__/
   /(   )\
  |\`> < /\
  \_|=='|_/

    WE TRUE NERDS
    WE OPTIMIZE OUR CFLAGS TOGETHER
    WE TALKIN ON IRC WITH www.opera.com TOGETHER
    send this PENGUIN to every thread you care about including this one if you care. C how many times you get this, if you get 256 your A TRUE NERD

Name: Anonymous 2007-05-09 16:53 ID:LCofLRwV

>>65
>>66
    WE TRUE NERDS
    WE READ SICP TOGETHER
    WE TALKIN ON IRC WITH www.opera.com TOGETHER

Name: Anonymous 2007-05-15 12:44 ID:1C2VWcd3

>>40

does this program terminate?

#!/usr/bin/env perl
use Quantum::Superpositions;
if(any(0,1))fork until 0;

Name: Anonymous 2007-05-15 14:02 ID:ZQivVtLG

>>68


    HAHAHAHAHAHAHAHHAHAHAHAAHAHAAAA!!!
    you think your tough huh?
    one word THE FORCED INDENTATION OF CODE.
    i have taken out two mission critical applications at the same time in less than 5 seconds i have been training for 3 years.
    also enterprise grade best practices.
    your compiler might be bigger than me,but i know mine is smarter and quicker.
    my compiler is 130 kb pure lean code.
    one keystroke and i'll overflow your buffers.
    your the one whose a nerd.i can optimize CFLAGS anytime i want you probably haven't ever touched CFLAGS before.
    you probably have sex with your computer.
    you don't even know me,and you don't want to.
    you'll be lucky if your even worth my attention one look at my code and you'll dissappear forever.
    though i'd be hapy to humiliate you in front of all your friends.
    btw IM the expertest.
    i have worked in maine, new hampshire, new york,utah, colorado,florida,bahamas.
    never indented my code!
    im undefeated in competitive obfuscation of code.
    im on my way to IOCCC.
    go ahead and come step anytime you want.b*tch

Name: Anonymous 2007-05-16 13:29 ID:QTvjglcc

>>69
LOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOLLOLOLOLOL

Name: Anonymous 2007-05-17 3:52 ID:tlQXtSBN

http://www.bookpool.com/ct/184

A 10-book list is his way to say "I've read SICP".

Name: Anonymous 2007-05-17 4:40 ID:jag43sHU

>>71
christ 10 fucking book rewviews just to say "I've read SICP", how fucking sad.>>71

Name: Anonymous 2007-05-19 7:29 ID:p+lkKaJ7

IM TELLING U MATE, SICP = IVE READ IT!!!!!!

Name: Anonymous 2008-04-23 10:02

I have read SICP as well. It's quite boring, actually.

Name: Anonymous 2008-04-25 6:33

My ``sick-pee'' has just arrived!! I'm so pleased. It's so funny to have a book with Scheme code in it.

Name: Anonymous 2008-04-25 7:17

Thanks to SICP I have learned to hax my anus.

Name: Anonymous 2011-01-07 11:34

What a shitty thread. I bet the 2011 will be better.

Name: Anonymous 2011-01-07 11:44

>1-77 didn't read their SICP.

Name: Anonymous 2011-01-07 11:44

>78
I mena they're

Name: Anonymous 2011-01-07 13:33

I read 4chan because I enjoy watching people who are depressed, suicidal, antisocial and socially abused talk about their life like they are normal and have no problems

there is your tl:dr in a nutshell

Name: Anonymous 2011-02-03 2:10

Name: Anonymous 2011-02-03 6:33

Name: Anonymous 2011-02-04 16:35

Name: Anonymous 2011-06-23 7:21

This thread has been threadstopped, you can't reply anymore.

Name: Anonymous 2011-06-23 7:32

>>84
fuck your moms penis

Name: Anonymous 2011-06-23 7:33

>>1
We meet again, Ive.

Name: Ive 2011-06-23 12:32

SICP

Name: Sgt.Kabu勇뽘kiman䅢㿓 2012-05-29 1:04

>>88
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
dubs won this time
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy

Don't change these.
Name: Email:
Entire Thread Thread List