My Projects
Closest Strings Challenge
This is C code that runs a program to solve the Closest Strings problem. The purpose of writing this program is simply to have fun optimizing this simple program as much as possible.
Combination Lock Crack
In this project, I use probabilistic inference (via Naive Bayes Classifier (NBC)) to demonstrate that bike locks (and other locks) that use a combination of digits are unsafe.
Digital Inputer
Digital Inputer is a python module that helps with simple logic computations. Given a raw input, such as (!A)^(B*X), this will create an instance of the DigitalInputer class. With that instance, one can give inputs such as [0,0,0], which will return the binary output of the given logic formula (in this case, the output would be 1).