A Short History of Computational Complexity Export

@inproceedings{Fortnow2002complexity, abstract = {It all started with a machine. In 1936, Turing developed his theoretical computational model. He based his model on how he perceived mathematicians think. As digital computers were developed in the 40\&\#039;s and 50\&\#039;s, the Turing machine proved itself as the right theoretical model for computation.}, author = {Fortnow, Lance and Homer, Steve}, booktitle = {The History of Mathematical Logic}, citeulike-article-id = {3150609}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.3900}, keywords = {complexity, computational}, posted-at = {2008-08-23 10:49:06}, priority = {2}, title = {A Short History of Computational Complexity}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.3900}, year = {2003} }

TY - CONF ID - Fortnow2002complexity L3 - citeulike-article-id:3150609 N2 - It all started with a machine. In 1936, Turing developed his theoretical computational model. He based his model on how he perceived mathematicians think. As digital computers were developed in the 40's and 50's, the Turing machine proved itself as the right theoretical model for computation. TI - A Short History of Computational Complexity T2 - The History of Mathematical Logic KW - complexity KW - computational AU - Fortnow, Lance AU - Homer, Steve PY - 2003/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.3900 ER -