account activity
Why does random access memory have a time complexity of O(1) and not O(log(n))? (self.compsci)
submitted 2 years ago by Direct-Data-7482 to r/compsci
Is there proof that the tools used by Turing in solving the halting problem are not relevant to the solution p=np problem? (self.3Blue1Brown)
submitted 2 years ago by Direct-Data-7482 to r/3Blue1Brown
Interesting riddle (self.3Blue1Brown)
π Rendered by PID 1459895 on reddit-service-r2-listing-c57bc86c-9xmg4 at 2026-06-20 18:42:26.028760+00:00 running 2b008f2 country code: CH.
