Computational Complexity

1
Computational Complexity

• Ilya Kamenetsky , Guy Davis and Sergey Kiselev
• Assignment 3.3 Classical Literature Review

Professor Yingxu Wang
October 5, 2005
2
Agenda

• About the author Juris Hartmanis
• Nature of Computer Science according to to the
  author
• Interesting conclusions of the article
• Our arguments / count-points on authors
  conclusions

3
Juris Hartmanis(1928-

• Born in Latvia, he lived in Germany and the
  United States
• Attended universities at Marburg, Kansas City,
  and Caltech.
• Worked at General Electric doing RD
• Professor at Cornell in their CS dept.

4
Nature of Computer Science(according to
Hartmanis)

• CS distinct among sciences as it is not directly
  governed by physical laws
• But precise quantitative laws govern the abstract
  process of computing
• Computer is a universal device capable of
  performing any calculation

5
Interesting Conclusions

• CS problems can be assigned to various complexity
  classes
• Open problem of feasible computing
• N NP? (Implications for encryption)

6
Our arguments / counter-points on authors
conclusions

• Is computer science really free from physical
  law?
• Authors discussion of feasible computing
  indicates bounds in practical problem-solving.

7
Any questions