Three traditions of computing: what educators should know
- 15 September 2008
- journal article
- research article
- Published by Taylor & Francis Ltd in Computer Science Education
- Vol. 18 (3), 153-170
- https://doi.org/10.1080/08993400802332332
Abstract
Educators in the computing fields are often familiar with the characterization of computing as a combination of theoretical, scientific, and engineering traditions. That distinction is often used to guide the work and disciplinary self-identity of computing professionals. But the distinction is, by no means, an easy one. The three traditions of computing are based on different principles, they have different aims, they employ different methods, and their products are very different. Educators in the field of computing should be aware of the fundamental differences between the traditions of computing so that they can offer their students a truthful and balanced view about computing branches. In this article the three traditions of computing are presented and some of their underlying assumptions, principles, application areas, restrictions, and weaknesses are portrayed. Also, some of the landmark arguments in the debates about the identity of computing disciplines are discussed.Keywords
This publication has 57 references indexed in Scilit:
- Computing is a natural scienceCommunications of the ACM, 2007
- Ten Commandments of Formal Methods ...Ten Years LaterComputer, 2006
- Philosophy of Computer ScienceTeaching Philosophy, 2005
- Readers' corner: The role of experiments in computer scienceJournal of Systems and Software, 1995
- A structure-based critique of contemporary computing researchJournal of Systems and Software, 1995
- Experimental evaluation in computer science: A quantitative studyJournal of Systems and Software, 1995
- Turing Award lecture on computational complexity and the nature of computer scienceCommunications of the ACM, 1994
- An experiment on program developmentBIT Numerical Mathematics, 1972
- Programming by action clustersBIT Numerical Mathematics, 1969
- Proof of algorithms by general snapshotsBIT Numerical Mathematics, 1966