Computer Science
Argonne National Lab
A post about my time as a SULI inter at Argonne.
SYCL
GPU programming
Statistics and Probability 2
Notes dedicated to Stat 410
Database Systems
Notes dedicated to CS 411
Ramsey Theory
Order From Chaos
P vs NP computational complexity in the heavens
The P vs NP problem, often regarded as the most significant unresolved issue in theoretical computer science, is one of the seven Millennium Prize Problems identified by the Clay Mathematics Institute, offering a reward of one million dollars for a conclusive proof or disproof. In simple terms, ‘P’ represents a category of problems that are comparatively easy to solve, whereas ‘NP’ encompasses problems that are, on the surface, extremely challenging. If P were equal to NP, it would suggest that these seemingly difficult problems actually have straightforward solutions. However, the intricacies of this concept are more complex.
The Art of Computer Programming
Donald Knuth
My study and notes on Donald Knuths work on algorithms.
Coming soon!
Functional Programming
Coming soon!
\(\lambda\)-Calculus
Coming soon!