its ok, NFA
non-deterministic finite automata being relatable
3 years ago by Napain to c/programmerhumor
QuazarOmega 2 points 3 years ago
This is too advanced, where is my code monkey humor??
/s (but I still don't know what those words together mean)
QuazarOmega 2 points 3 years ago
Ohh ok lmao, I thought the joke was something very technical
cranberryjam 1 point 3 years ago
I'm having flashbacks to my theory to computation class. So much latex. So many proofs...
programmerhumor
@lemmy.ml
43801
1628
1576
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.
go to feed...
programmerhumor
@lemmy.ml
43801
1628
1576
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.
go to feed...
"This problem is log-space-reducible to the reachability problem." xD
save