| The outer limits of programming |
| Full text |
Pdf
(425 KB)
|
| Source
|
ACM Southeast Regional Conference
archive
Proceedings of the 38th annual on Southeast regional conference
table of contents
Clemson, South Carolina
SESSION: AI and complexity
table of contents
Pages: 38 - 41
Year of Publication: 2000
ISBN:1-58113-250-6
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 3, Citation Count: 0
|
|
|
ABSTRACT
We tend to believe that any programming task, no matter how large or complex, can be completed if we have enough time and resources. There is a growing body of evidence that this belief is mistaken, and some tasks may be beyond our capabilities. We may already be approaching our limits to manage complexity.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Cf. F. P. Brooks Jr., "No Silver Bullet," first published in Information Processing '86, ISBN # 0-444-70044-3
|
 |
2
|
|
| |
3
|
David Gellernter, op.cit
|
| |
4
|
David Gellernter, "Truth Beauty and the Virtual Machine," Discover, September 1997, pp. 72ff
|
| |
5
|
W. Wayt Gibbs, "Software's Chronic Crisis," Scientific American, September 1994, pp. 86, 87, 89
|
 |
6
|
|
| |
7
|
Cf. Henry Lieberman, "The Debugging Scandal and What To Do about It," Communications of the ACM, April 1997 p. 27ff
|
| |
8
|
David Parnas of Queens University in Kingston Ontario quoted in Science News vol. 139, February 1997, p. 104
|
| |
9
|
As quoted by I. Peterson in Science News, vol. 139, February 1997, p. 104
|
| |
10
|
Evan I. Schwartz, Discover Magazine, May 1996, p. 80
|
|