Reading Cs Classics
Loading...
Files
Date
2012
Authors
Tekir, Selma
Journal Title
Journal ISSN
Volume Title
Publisher
Association for Computing Machinery (ACM)
Open Access Color
BRONZE
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
Knowledge of the theories of computer science (CS) helps in understanding the limitations of the field by providing users with new perspectives and insights. It can be a good practice for CS professionals to compile their own list of classics that highlights some key scientific concepts of the field. 'An Axiomatic Basis for Computer Programming,' by C.A.R. Hoare is a CS classic, which tells about the computing industry of the 1960s and 1970s in Britain. Hoare provides a foundation for the formal proofs of programs by an algebraic assertions-based approach. 'Computing Machinery and Intelligence,' by A.M. Turing tells about the computer numbering systems that provide unique representation to every programming construct. Dijkstra' s realization of the high intellectual challenge of programming and his encouragement made him one of the greatest minds of computer programming. Donald Knuth is extraordinary with his perspective on computer programming.
Description
Keywords
Computer programming, Computing industry, Dijkstra, Formal proofs, Good practices, Numbering systems, Formal proofs, Computing industry, Dijkstra, Good practices, Computer programming, Numbering systems
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
Tekir, S. (2012). Reading CS classics. Communications of the ACM, 55(4), 32-34. doi:10.1145/2133806.2133818
WoS Q
Q1
Scopus Q
Q1

OpenCitations Citation Count
N/A
Source
Communications of the ACM
Volume
55
Issue
4
Start Page
32
End Page
34
PlumX Metrics
Citations
Scopus : 0
Captures
Mendeley Readers : 15
Google Scholar™


