Jay Van Dam's repositories
Battleship
A command line based recreation of the game Battleship written in C++.
game-engine
CIS380 Game Engine
game-of-life
A command line based version of John Conway's Game of Life written in C.
goal-tracker
A React Native application for Android and iOS to add and removes goals in one simple app that incoperates core React Native concepts.
ObjectID_ARKit
Project detects multiple objects in Augmented Reality and generates labels on top of them using Core ML & ARKit.
Zoomjoystrong-language
A new programming language using Flex and Bison written in C. This language is not very complex (certainly not Turing complete!).
np-complete
In computational complexity theory, a problem is NP-complete when: A nondeterministic Turing machine can solve it in polynomial-time. A deterministic Turing machine can solve it in large time complexity classes (e.g., EXPTIME, as is the case with brute force search algorithms) and can verify its solutions in polynomial time. It can be used to simulate any other problem with similar solvability.
resume
based on Jake's Resume Template from Overleaf