Programmer Humor

32464 readers

468 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

Posts must be relevant to programming, programmers, or computer science.
No NSFW content.
Jokes must be in good taste. No hate speech, bigotry, etc.

founded 5 years ago

MODERATORS

cat_programmer@lemmy.ml

AgreeableLandscape@lemmy.ml

1097

Early disappointment (lemmy.ml)

submitted 1 year ago by coja@lemmy.ml to c/programmerhumor@lemmy.ml

92 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] christian@lemmy.ml 1 points 1 year ago (1 children)

It's been a long long time since I touched this but I'm still almost positive deterministic machines can solve everything in NP already.

[–] rockSlayer@lemmy.world 0 points 1 year ago

They exist in the same grammatical hierarchy so theoretically they can solve the same problems. What I should have said was that nondeterministic turing machines can solve NP problems in P