[CSUSB]>> [CNS]>> [CSE]>> [R J Botting]>> biba.php
Bibliographic Item (1.0)
- Juris Harmanis
- Turing Award Lecture: On computational complexity and the Nature of Computer science
- Comm ACM V??n??(?? 1994)pp also Computer Surveys V27n1(Mar 1994)pp7-16(in
- =TALK SCIENCE ENGINEERING PARADIGMs
From the computing surveys version
p13: theories in CS do not compete with each other re how well they fit nature, nor are CS theories developed to explain anomalous observations, no history of critical experiements, problems in complexity were resolved by theoretical work. CS "advances are often demonstrated and documented by a draatic demonstration rather than a dramatic experiment"... the role of DEMOs..."demo or die"
p14: CS is the engineering of mathematics
Search for bibliographic items containing a matching string.
Search for a specific bibliographic item by name.
To see the complete bibliography (1Mb+) select:[Bibliography]