
 Computational Complexity: Defining Theory 
  Computational complexity and other fun stuff in math and computer science as viewed by Lance Fortnow. 
  The field of theoretical computer science is interpreted broadly so as to include algorithms, data structures, complexity theory, distributed computation, parallel computation, VLSI, machine learning, computational biology, computational geometry, information theory, cryptography, quantum computation, computational number theory and algebra, program semantics and verification, automata theory, and the study of randomness. 
  This would take into account that theory covers not only 'internal' topics (as suggested by the "analysis of computation/information processing" definition), but is also sometimes applied to understand and develop tools for 'external' areas that have a computational character (such as ecommerce, comp. 
 weblog.fortnow.com /2005/06/definingtheory.html (1852 words) 
