I’ve just found out an interesting MIT course on Philosophy and Theoretical Computer Science with code 6.893 and thought by Scott Aaronson. The most attractive part of this course for me was articles included in the reading list of the web page. There are great articles in that list: Scott Aaronson, NP-complete Problems and Physical Reality [...]
Posts Tagged ‘theoretical computer science’
Math behind the Quantum Computers
AMS has excellent math articles for introductory and general audience in a series of feature columns every month. Luckily those articles are accessible from the web. Recently I noticed two very interesting articles on mathematics behind the quantum computers. The articles can be accessed from those links part 1 and part 2. The math described [...]
P versus NP
ClayMath has a very nice description for the problem of p versus np: Suppose that you are organizing housing accommodations for a group of four hundred university students. Space is limited and only one hundred of the students will receive places in the dormitory. To complicate matters, the Dean has provided you with a list [...]
Recent Comments