Help Stamp Out Programming
This paper is concerned with a subject that is generally neglected - computers that cannot be reporgrammed. The title calls attention to an assumption that everybody makes and so no one is conscious of making: If you want a computer to do something, you must have a program prepared for the purpose. To be explicit, someone must conceive an effectively complete procedure for the job, specify it accurately in terms that the computer can accept, and command the computer to carry out the procedure as specified.
Unable to display preview. Download preview PDF.
- 1.Culbertson, J.T. (1956). “Some uneconomical robots.” In Automata Theory, Shannon, C.E., and McCarthy, J., eds., Annals of Math. Studies, Vol. 34, Princeton: Princeton Univ. PressGoogle Scholar
- 2.Ernst, G.W. and Newell, A. (1967). “Some issues of representation in a general problem solver.” AFIPS Conf. Proc, Vol. 30, pp. 583–600. Wash., D.C.: Thompson BooksGoogle Scholar
- 4.Green, C. (1969). “Application of theorem-proving to problem-solving.” Proc. Intl. Joint Conf. on Artificial Intelligence. Bedford, Mass.: The MITRE CorpGoogle Scholar
- 5.Hebb, D.O. (1949). The Organization of Behavior. New York: John Wiley & Sons, IncGoogle Scholar
- 7.Newell, A.J., Shaw, J.C., and Simon, H.A. (1960). “A variety of intelligent learning in a general problem solver.” Self-organizing Systems, Yovits, M., and Cameron, S., eds., New York: Pergamon PressGoogle Scholar
- 8.Nilsson, N.J. (1969). “A mobile automaton.” Proc. Intl. Joint Conf. on Artificial Intelligence. Bedford, Mass.: The MITRE CorpGoogle Scholar
- 9.Simon, H.A. (1960). The New Science of Management Decision. New York: Harper & RowGoogle Scholar