I met Mr. T.

Discussion in 'TRIBE Main Forum' started by BigBadBaldy, Mar 12, 2002.

  1. Rosey

    Rosey TRIBE Member

    that's just wrong!!!!
     
  2. deep

    deep TRIBE Member

    i love you
     
  3. JayIsBored

    JayIsBored TRIBE Member

    Mr. Tosserofninjasalad was too long, his agent shortened it up.
     
  4. Bass-Invader

    Bass-Invader TRIBE Member

    better that than the drumstick.
     
  5. deep

    deep TRIBE Member

    do you think mr. t is teabaggin or rimjobbin the ninja?

    I need some clarity for masturbatory purposes
     
  6. deep

    deep TRIBE Member

    ninjas don't wear combat boots though
     
  7. joey

    joey TRIBE Member

    homer had a chance to meet mr t once, he kept saying he'll go later, he'll go later, then when he finally did go he found out Mr.T. had just left and when he asked the mall guy if he'd ever be back he said he didnt know
     
  8. deep

    deep TRIBE Member

    quoting this so when you actually read through the thread and see that this was already pointed out it will be immortalized :)
     
  9. Bass-Invader

    Bass-Invader TRIBE Member

    not sure, i think he is trying to extract this though:


    [​IMG]

    *cue entry into a dot on the polka dot door*
     
  10. deep

    deep TRIBE Member

    I can't believe that your rogers email address is raisetheroof
     
  11. JayIsBored

    JayIsBored TRIBE Member

    don't yell at joey. he's just a little slow
     
  12. Bass-Invader

    Bass-Invader TRIBE Member

    [​IMG]
    I did this when I confirmed it.
     
  13. air-bag

    air-bag TRIBE Member

    let me say it again:

    BASS INVADER IS THE KING OF ROOFLES

    chris! icq me when u're in town1
     
  14. Bass-Invader

    Bass-Invader TRIBE Member

    that pic makes me NP-hard

    probably be back in may...

    i don't know whats going on..i think weather changes make me act silly, that or reading complexity theory.
     
  15. air-bag

    air-bag TRIBE Member

    Re: that pic makes me NP-hard


    WHAT!?!?! URE READING THE COMPLEXITY ANALYSIS THEORY!?!?!

    ICQ QUICKLY.

    I'm doing an assignment on it now..... Prof. Cook .. the guy who invented NP-completeness has designed our course.. i'm fuct.
     
  16. Bass-Invader

    Bass-Invader TRIBE Member

    oh shit..
    cook isn't your teacher is he?!?

    that's no fun, this stuff is really tough to get behind...
     
  17. air-bag

    air-bag TRIBE Member

    Cook is not teaching this year.
    I got some other prof. And she has a particular way of complicating things. 80% drop rate by the 5th week of classes kind of says something about this course.....
     
  18. miguel

    miguel TRIBE Member

    Re: Re: that pic makes me NP-hard

    i took his class, did pretty well in it actually

    the exam was crazy though!!

    although "invention" is a strong term, it's more like he took some unanswered questions further..
     
  19. air-bag

    air-bag TRIBE Member

    Re: Re: Re: that pic makes me NP-hard

    Who was u'r prof? Did u take it with Tonian Pitassi?

    She goes from Turing machines and RE reductions to NP completeness and then to greedy algorithms. All backwards...

    there are 30 students left in class... we started with 150.
     
  20. joey

    joey TRIBE Member

    how about is deep and JIB shut the hell up?

    ya that would be nice!

    I DO WHAT I WANT :mad:
     
  21. miguel

    miguel TRIBE Member

    i just looked at your assignment, i don't have sipser handy but the stuff that's on the actual page doesn't look tooo bad..

    here's a suggestion: get Garey and Johnson's book on NP Completeness, it was written in 1979 and will no doubt have probably every single NP Complete problem you will see in that class including reductions

    (our tests were allways lifted right out of there)
     
  22. miguel

    miguel TRIBE Member

    Re: Re: Re: Re: that pic makes me NP-hard

    i took it with Cook
     
  23. air-bag

    air-bag TRIBE Member

    You are looking at the wrong section.

    Our assignment is exercises from the book Intro. To theory of computation by michael sipser.

    here are the Q. that i'm stuck with now:

    1. Show that if P=NP we can factor integers in polynomial time.
    It is really not as simple as it looks...trust

    2. prove that HALF-CLIQUE is in NP-COMPLETE.
    half clique is the same as CLIQUE but only when the graph has a clique of size n/2 or more
     
  24. deep

    deep TRIBE Member

    request denied

    dismissed
     

Share This Page