Quantum Computing Inc.The million-dollar question: does P = NP?If you want to make an easy million dollars, all you have to do is prove that P either does or does not equal NP. Sounds easy right?1d ago1d ago
justin1.4: Finite Automata, Wall-hacking, and their Equivalence in PowerMaybe nondeterminism is overrated?5d ago5d ago
justin1.0: Computational Models, Esports, and DFAsMy poking fun at Gold players is friendly fire.5d ago5d ago
justinThe Gamer’s Guide to Computational TheoryIn my experience as a TA for the undergraduate computational theory course at my university, computational theory is often times difficult…5d ago5d ago
Rabia RiazP vs NP? The biggest unsolved mystery in Computer Science…P vs NP is an unsolved mystery in the world of computer science that asks whether P is equal to NP or NP is equal to P (i.e. P=NP). In…Sep 11Sep 11
Eric LeeEmergence Is Not a New Idea, but May Be New to YouLumpability is a technical term (bet you didn’t know that)Sep 92Sep 92
The Bug ReportHow to Measure Complexity16 levels of hierarchy that determine how hard you have to think.Jul 9Jul 9
Kris MerckxChapter 1: History is about data, not datesI myself stood in front of the classroom as a history teacher for more than 20 years. Even though political history was never really my…May 29May 29
