Monthly Archives: May 2014

Exploring Artifical Intelligence – Can Machines Think?

Artificial Intelligence is both a topic of Computer Science and Philosophy, and begins to ask what really makes us human and if we are just a complex biological machine? Alan Turing first asked the question in his 1950 paper named … Continue reading

Posted in Computer Science, Miscellaneous | Leave a comment

Deterministic Polymonial Time (P) and Non-Deterministic Polymonial Time (NP)

This is going to be a short description of the difference between P and NP time complexity classes, and what the time complexity classes are based upon. These are used for Computational Complexity and Algorithm Analysis. Computability Theory is mainly … Continue reading

Posted in Theoretical Computer Science | Leave a comment