Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/5043
Title: | Reading CS classics | Authors: | Tekir, Selma | Keywords: | Computer programming Computing industry Dijkstra Formal proofs Good practices Numbering systems |
Publisher: | Association for Computing Machinery (ACM) | Source: | Tekir, S. (2012). Reading CS classics. Communications of the ACM, 55(4), 32-34. doi:10.1145/2133806.2133818 | 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. | URI: | http://doi.org/10.1145/2133806.2133818 http://hdl.handle.net/11147/5043 |
ISSN: | 0001-0782 |
Appears in Collections: | Computer Engineering / Bilgisayar Mühendisliği Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
Page view(s)
688
checked on Sep 2, 2024
Download(s)
686
checked on Sep 2, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.