c/programmerhumor · by Napain@lemmy.ml · 3ynon-deterministic finite automata being relatable its ok, NFA 23 points · 5 comments · view on lemmy.world
5 Comments
QuazarOmega@lemmy.world · 2 pts · 3y
This is too advanced, where is my code monkey humor??
/s (but I still don't know what those words together mean)
Napain@lemmy.ml · 2 pts · 3y
the joke is that it just sounds funny, like PHARDNESS
QuazarOmega@lemmy.world · 2 pts · 3y
Ohh ok lmao, I thought the joke was something very technical
Napain@lemmy.ml · 2 pts · 3y
"This problem is log-space-reducible to the reachability problem." xD
cranberryjam@lemmy.blahaj.zone · 1 pts · 3y
I'm having flashbacks to my theory to computation class. So much latex. So many proofs...