Napain

joined 2 years ago
sorted by: new top controversial old
non-deterministic finite automata being relatable in c/programmerhumor@lemmy.ml
[–] Napain@lemmy.ml 1 points 2 years ago (1 children)

the joke is that it just sounds funny, like PHARDNESS

non-deterministic finite automata being relatable in c/programmerhumor@lemmy.ml
[–] Napain@lemmy.ml 1 points 2 years ago

"This problem is log-space-reducible to the reachability problem." xD

Unclassified FBI Document: Ability to legally access Secure Messaging App Content and Metadata (January 2021) in c/technology@beehaw.org
[–] Napain@lemmy.ml 14 points 2 years ago (5 children)

i love how telegram isn't even encrypted or anything but they just ghost the authorities

view more: ‹ prev next ›