Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: poll ideas quest 2007 (theory of computation is...)

by blokhead (Monsignor)
on Dec 16, 2007 at 16:44 UTC ( #657289=note: print w/ replies, xml ) Need Help??


in reply to poll ideas quest 2007

Theory of computation (Turing machines, automata, computational complexity, algorithms, NP completeness, big-O) is ...

  • The crowning achievement of humankind
  • Awesome; the PCP theorem makes me weak in the knees
  • Pretty cool; I've even applied some of those things in practice
  • Interesting, but hard to understand
  • Something I've always wanted to learn more about, but never have the time
  • Something I don't think I'll ever really understand
  • Irrelevant for me; Never used it, never will
  • In theory the same as practice, but in practice it's not*
  • Something I barely survived in school and never want to think about again
  • Best left to someone other than me
  • A necessary evil in computer science
  • A tactic employed by CS departments to make their students miserable
  • A bunch of useless, self-important, academic jibberish
  • Too impenetrable and abstract to even make up my mind

blokhead


Comment on Re: poll ideas quest 2007 (theory of computation is...)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://657289]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (8)
As of 2014-07-25 08:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (169 votes), past polls