Product Code Database
Example Keywords: medical -ipad $76-196
barcode-scavenger
   » Wiki: Computer Science
Tag Wiki 'Computer Science'.
Tag

Computer science is the study of , , and .

(1980). 9780262010603, MIT Press. .
Computer science spans theoretical disciplines (such as , theory of computation, information theory, and automation) to (including the design and implementation of hardware and software). Computer science is generally considered an area of and distinct from computer programming.

and are central to computer science.

(2023). 9783642441356, Springer Berlin. .

The theory of computation concerns abstract models of computation and general classes of problems that can be solved using them. The fields of and computer security involve studying the means for secure communication and for preventing security vulnerabilities. Computer graphics and computational geometry address the generation of images. Programming language theory considers different ways to describe computational processes, and theory concerns the management of repositories of data. Human–computer interaction investigates the interfaces through which humans and computers interact, and software engineering focuses on the design and principles behind developing software. Areas such as , and investigate the principles and design behind . Computer architecture describes the construction of computer components and computer-operated equipment. Artificial intelligence and aim to synthesize goal-orientated processes such as problem-solving, decision-making, environmental adaptation, planning and learning found in humans and animals. Within artificial intelligence, aims to understand and process image and video data, while natural language processing aims to understand and process textual and linguistic data.

The fundamental concern of computer science is determining what can and cannot be automated. The is generally recognized as the highest distinction in computer science.


History
The earliest foundations of what would become computer science predate the invention of the modern . Machines for calculating fixed numerical tasks such as the have existed since antiquity, aiding in computations such as multiplication and division. for performing computations have existed since antiquity, even before the development of sophisticated computing equipment.

Wilhelm Schickard designed and constructed the first working mechanical calculator in 1623. In 1673, Gottfried Leibniz demonstrated a digital mechanical calculator, called the . Leibniz may be considered the first computer scientist and information theorist, because of various reasons, including the fact that he documented the binary number system. In 1820, Thomas de Colmar launched the mechanical calculator industryIn 1851 when he invented his simplified , the first calculating machine strong enough and reliable enough to be used daily in an office environment. started the design of the first automatic mechanical calculator, his Difference Engine, in 1822, which eventually gave him the idea of the first programmable mechanical calculator, his Analytical Engine. He started developing this machine in 1834, and "in less than two years, he had sketched out many of the features of the modern computer".

(1982). 9780691083032 .
"A crucial step was the adoption of a punched card system derived from the " making it infinitely programmable."The introduction of punched cards into the new engine was important not only as a more convenient form of control than the drums, or because programs could now be of unlimited extent, and could be stored and repeated without the danger of introducing errors in setting the machine by hand; it was important also because it served to crystallize Babbage's feeling that he had invented something really new, something much more than a sophisticated calculating machine." Bruce Collier, 1970 In 1843, during the translation of a French article on the Analytical Engine, wrote, in one of the many notes she included, an algorithm to compute the , which is considered to be the first published algorithm ever specifically tailored for implementation on a computer. Around 1885, invented the tabulator, which used to process statistical information; eventually his company became part of . Following Babbage, although unaware of his earlier work, in 1909 published the 2nd of the only two designs for mechanical analytical engines in history. In 1937, one hundred years after Babbage's impossible dream, Howard Aiken convinced IBM, which was making all kinds of punched card equipment and was also in the calculator business"In this sense Aiken needed IBM, whose technology included the use of punched cards, the accumulation of numerical data, and the transfer of numerical data from one register to another", Bernard Cohen, p.44 (2000) to develop his giant programmable calculator, the ASCC/Harvard Mark I, based on Babbage's Analytical Engine, which itself used cards and a central computing unit. When the machine was finished, some hailed it as "Babbage's dream come true".Brian Randell, p. 187, 1975

During the 1940s, with the development of new and more powerful machines such as the Atanasoff–Berry computer and , the term computer came to refer to the machines rather than their human predecessors.The Association for Computing Machinery (ACM) was founded in 1947. As it became clear that computers could be used for more than just mathematical calculations, the field of computer science broadened to study in general. In 1945, founded the Watson Scientific Computing Laboratory at Columbia University in New York City. The renovated fraternity house on Manhattan's West Side was IBM's first laboratory devoted to pure science. The lab is the forerunner of IBM's Research Division, which today operates research facilities around the world. Ultimately, the close relationship between IBM and Columbia University was instrumental in the emergence of a new scientific discipline, with Columbia offering one of the first academic-credit courses in computer science in 1946. Computer science began to be established as a distinct academic discipline in the 1950s and early 1960s. The world's first computer science degree program, the Cambridge Diploma in Computer Science, began at the University of Cambridge Computer Laboratory in 1953. The first computer science department in the United States was formed at Purdue University in 1962. Since practical computers became available, many applications of computing have become distinct areas of study in their own rights.


Etymology
Although first proposed in 1956, the term "computer science" appears in a 1959 article in Communications of the ACM, in which Louis Fein argues for the creation of a Graduate School in Computer Sciences analogous to the creation of Harvard Business School in 1921. Louis justifies the name by arguing that, like management science, the subject is applied and interdisciplinary in nature, while having the characteristics typical of an academic discipline. His efforts, and those of others such as numerical analyst , were rewarded: universities went on to create such departments, starting with Purdue in 1962. (1972). "George Forsythe and the Development of Computer Science". Comms. ACM. Despite its name, a significant amount of computer science does not involve the study of computers themselves. Because of this, several alternative names have been proposed. Certain departments of major universities prefer the term computing science, to emphasize precisely that difference. Danish scientist suggested the term datalogy, to reflect the fact that the scientific discipline revolves around data and data treatment, while not necessarily involving computers. The first scientific institution to use the term was the Department of Datalogy at the University of Copenhagen, founded in 1969, with Peter Naur being the first professor in datalogy. The term is used mainly in the Scandinavian countries. An alternative term, also proposed by Naur, is ; this is now used for a multi-disciplinary field of data analysis, including statistics and databases.

In the early days of computing, a number of terms for the practitioners of the field of computing were suggested in the Communications of the ACMturingineer, turologist, flow-charts-man, applied meta-mathematician, and applied . Three months later in the same journal, comptologist was suggested, followed next year by hypologist.Communications of the ACM 2(1):p.4 The term computics has also been suggested.IEEE Computer 28(12): p.136 In Europe, terms derived from contracted translations of the expression "automatic information" (e.g. "informazione automatica" in Italian) or "information and mathematics" are often used, e.g. informatique (French), Informatik (German), informatica (Italian, Dutch), informática (Spanish, Portuguese), informatika ( and Hungarian) or pliroforiki ( πληροφορική, which means informatics) in . Similar words have also been adopted in the UK (as in the School of Informatics, University of Edinburgh).P. Mounier-Kuhn, L'Informatique en France, de la seconde guerre mondiale au Plan Calcul. L'émergence d'une science, Paris, PUPS, 2010, ch. 3 & 4. "In the U.S., however, is linked with applied computing, or computing in the context of another domain."

A folkloric quotation, often attributed to—but almost certainly not first formulated by—Edsger Dijkstra, states that "computer science is no more about computers than astronomy is about telescopes."See the entry "" on Wikiquote for the history of this quotation. The design and deployment of computers and computer systems is generally considered the province of disciplines other than computer science. For example, the study of computer hardware is usually considered part of computer engineering, while the study of commercial and their deployment is often called information technology or information systems. However, there has been exchange of ideas between the various computer-related disciplines. Computer science research also often intersects other disciplines, such as cognitive science, linguistics, , , , , statistics, , and .

Computer science is considered by some to have a much closer relationship with mathematics than many scientific disciplines, with some observers saying that computing is a mathematical science. Early computer science was strongly influenced by the work of mathematicians such as Kurt Gödel, , John von Neumann, Rózsa Péter and and there continues to be a useful interchange of ideas between the two fields in areas such as mathematical logic, , , and .

The relationship between Computer Science and Software Engineering is a contentious issue, which is further muddied by disputes over what the term "Software Engineering" means, and how computer science is defined. , taking a cue from the relationship between other engineering and science disciplines, has claimed that the principal focus of computer science is studying the properties of computation in general, while the principal focus of software engineering is the design of specific computations to achieve practical goals, making the two separate but complementary disciplines., p. 19: "Rather than treat software engineering as a subfield of computer science, I treat it as an element of the set, Civil Engineering, Mechanical Engineering, Chemical Engineering, Electrical Engineering, ..."

The academic, political, and funding aspects of computer science tend to depend on whether a department is formed with a mathematical emphasis or with an engineering emphasis. Computer science departments with a mathematics emphasis and with a numerical orientation consider alignment with computational science. Both types of departments tend to make efforts to bridge the field educationally if not across all research.


Philosophy

Epistemology of computer science
Despite the word "science" in its name, there is debate over whether or not computer science is a discipline of science, mathematics, or engineering. and Herbert A. Simon argued in 1975, It has since been argued that computer science can be classified as an empirical science since it makes use of empirical testing to evaluate the correctness of programs, but a problem remains in defining the laws and theorems of computer science (if any exist) and defining the nature of experiments in computer science. Proponents of classifying computer science as an engineering discipline argue that the reliability of computational systems is investigated in the same way as bridges in civil engineering and airplanes in aerospace engineering. They also argue that while empirical sciences observe what presently exists, computer science observes what is possible to exist and while scientists discover laws from observation, no proper laws have been found in computer science and it is instead concerned with creating phenomena.

Proponents of classifying computer science as a mathematical discipline argue that computer programs are physical realizations of mathematical entities and programs can be deductively reasoned through mathematical . Computer scientists Edsger W. Dijkstra and regard instructions for computer programs as mathematical sentences and interpret formal semantics for programming languages as mathematical .


Paradigms of computer science
A number of computer scientists have argued for the distinction of three separate paradigms in computer science. argued that those paradigms are science, technology, and mathematics. Peter Denning's working group argued that they are theory, abstraction (modeling), and design. Amnon H. Eden described them as the "rationalist paradigm" (which treats computer science as a branch of mathematics, which is prevalent in theoretical computer science, and mainly employs deductive reasoning), the "technocratic paradigm" (which might be found in engineering approaches, most prominently in software engineering), and the "scientific paradigm" (which approaches computer-related artifacts from the empirical perspective of , identifiable in some branches of artificial intelligence). Computer science focuses on methods involved in design, specification, programming, verification, implementation and testing of human-made computing systems.


Fields
As a discipline, computer science spans a range of topics from theoretical studies of algorithms and the limits of computation to the practical issues of implementing computing systems in hardware and software.
(2023). 9780309093019, National Academies Press. .
CSAB, formerly called Computing Sciences Accreditation Board—which is made up of representatives of the Association for Computing Machinery (ACM), and the IEEE Computer Society (IEEE CS)—identifies four areas that it considers crucial to the discipline of computer science: theory of computation, algorithms and data structures, programming methodology and languages, and computer elements and architecture. In addition to these four areas, CSAB also identifies fields such as software engineering, artificial intelligence, computer networking and communication, database systems, parallel computation, distributed computation, human–computer interaction, computer graphics, operating systems, and numerical and symbolic computation as being important areas of computer science.


Theoretical computer science
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from the practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies.


Theory of computation
According to Peter Denning, the fundamental question underlying computer science is, "What can be automated?" Theory of computation is focused on answering fundamental questions about what can be computed and what amount of resources are required to perform those computations. In an effort to answer the first question, computability theory examines which computational problems are solvable on various theoretical models of computation. The second question is addressed by computational complexity theory, which studies the time and space costs associated with different approaches to solving a multitude of computational problems.

The famous P = NP? problem, one of the Millennium Prize Problems, Clay Mathematics Institute P = NP is an open problem in the theory of computation.

M= \{ X : X \not\in X \}
Computability theoryComputational complexity theory
Models of computationLogic circuit theoryCellular automata


Information and coding theory
Information theory, closely related to and , is related to the quantification of information. This was developed by to find fundamental limits on signal processing operations such as compressing data and on reliably storing and communicating data. Coding theory is the study of the properties of (systems for converting information from one form to another) and their fitness for a specific application. Codes are used for , , error detection and correction, and more recently also for network coding. Codes are studied for the purpose of designing efficient and reliable data transmission methods. Van-Nam Huynh; Vladik Kreinovich; Songsak Sriboonchitta; 2012. Uncertainty Analysis in Econometrics with Applications. Springer Science & Business Media. p. 63. .

Algorithmic information theorySignal detection theoryKolmogorov complexity


Data structures and algorithms
Data structures and algorithms are the studies of commonly used computational methods and their computational efficiency.

Analysis of algorithmsCombinatorial optimizationComputational geometryRandomized algorithms


Programming language theory and formal methods
Programming language theory is a branch of computer science that deals with the design, implementation, analysis, characterization, and classification of programming languages and their individual features. It falls within the discipline of computer science, both depending on and affecting , software engineering, and . It is an active research area, with numerous dedicated academic journals.

Formal methods are a particular kind of based technique for the specification, development and verification of software and hardware systems.Phillip A. Laplante, 2010. Encyclopedia of Software Engineering Three-Volume Set (Print). CRC Press. p. 309. . The use of formal methods for software and hardware design is motivated by the expectation that, as in other engineering disciplines, performing appropriate mathematical analysis can contribute to the reliability and robustness of a design. They form an important theoretical underpinning for software engineering, especially where safety or security is involved. Formal methods are a useful adjunct to software testing since they help avoid errors and can also give a framework for testing. For industrial use, tool support is required. However, the high cost of using formal methods means that they are usually only used in the development of high-integrity and life-critical systems, where safety or security is of utmost importance. Formal methods are best described as the application of a fairly broad variety of theoretical computer science fundamentals, in particular logic calculi, , , and program semantics, but also and algebraic data types to problems in software and hardware specification and verification.

\Gamma\vdash x: \text{Int}
Formal semanticsCompiler designProgramming languagesFormal verificationAutomated theorem proving


Applied computer science

Computer graphics and visualization
Computer graphics is the study of digital visual contents and involves the synthesis and manipulation of image data. The study is connected to many other fields in computer science, including , , and computational geometry, and is heavily applied in the fields of special effects and .
2D computer graphicsComputer animationRendering


Image and sound processing
can take the form of images, sound, video or other multimedia. of information can be streamed via . Its processing is the central notion of , the European view on , which studies information processing algorithms independently of the type of information carrier - whether it is electrical, mechanical or biological. This field plays important role in information theory, telecommunications, information engineering and has applications in medical image computing and , among others. What is the lower bound on the complexity of fast Fourier transform algorithms? is one of unsolved problems in theoretical computer science.
FFT algorithmsSpeech recognitionMedical image computing


Computational science, finance and engineering
Scientific computing (or computational science) is the field of study concerned with constructing mathematical models and quantitative analysis techniques and using computers to analyze and solve problems. A major usage of scientific computing is of various processes, including computational , physical, electrical, and electronic systems and circuits, as well as societies and social situations (notably war games) along with their habitats, among many others. Modern computers enable optimization of such designs as complete aircraft. Notable in electrical and electronic circuit design are SPICE,Muhammad H. Rashid, 2016. SPICE for Power Electronics and Electric Power. CRC Press. p. 6. . as well as software for physical realization of new (or modified) designs. The latter includes essential design software for integrated circuits.

Numerical analysisComputational physicsComputational chemistryPsychoinformaticsMedical informaticsComputational engineeringComputational musicology


Social computing and human–computer interaction
Social computing is an area that is concerned with the intersection of social behavior and computational systems. Human–computer interaction research develops theories, principles, and guidelines for user interface designers.


Software engineering
Software engineering is the study of designing, implementing, and modifying the software in order to ensure it is of high quality, affordable, maintainable, and fast to build. It is a systematic approach to software design, involving the application of engineering practices to software. Software engineering deals with the organizing and analyzing of software—it doesn't just deal with the creation or manufacture of new software, but its internal arrangement and maintenance. For example , systems engineering, and software development processes.


Artificial intelligence
Artificial intelligence (AI) aims to or is required to synthesize goal-orientated processes such as problem-solving, decision-making, environmental adaptation, learning, and communication found in humans and animals. From its origins in and in the Dartmouth Conference (1956), artificial intelligence research has been necessarily cross-disciplinary, drawing on areas of expertise such as applied mathematics, symbolic logic, , electrical engineering, philosophy of mind, , and social intelligence. AI is associated in the popular mind with , but the main field of practical application has been as an embedded component in areas of software development, which require computational understanding. The starting point in the late 1940s was 's question "Can computers think?", and the question remains effectively unanswered, although the is still used to assess computer output on the scale of human intelligence. But the automation of evaluative and predictive tasks has been increasingly successful as a substitute for human monitoring and intervention in domains of computer application involving complex real-world data.

Computational learning theoryNeural networksPlanning and scheduling
Natural language processingComputational game theoryEvolutionary computationAutonomic computing
Representation and reasoningPattern recognitionSwarm intelligence


Computer systems

Computer architecture and organization
Computer architecture, or digital computer organization, is the conceptual design and fundamental operational structure of a computer system. It focuses largely on the way by which the central processing unit performs internally and accesses addresses in memory. Computer engineers study computational logic and design of computer hardware, from individual processor components, , personal computers to and . The term "architecture" in computer literature can be traced to the work of Lyle R. Johnson and , members of the Machine Organization department in IBM's main research center in 1959.

Processing unitMicroarchitecture
Ubiquitous computingSystems architectureInput/output
Real-time computingInterpreter


Concurrent, parallel and distributed computing
Concurrency is a property of systems in which several computations are executing simultaneously, and potentially interacting with each other.Jiacun Wang, 2017. Real-Time Embedded Systems. Wiley. p. 12. . A number of mathematical models have been developed for general concurrent computation including , and the Parallel Random Access Machine model.Gordana Dodig-Crnkovic; Raffaela Giovagnoli; 2013. Computing Nature: Turing Centenary Perspective. Springer Science & Business Media. p. 247. . When multiple computers are connected in a network while using concurrency, this is known as a distributed system. Computers within that distributed system have their own private memory, and information can be exchanged to achieve common goals.Simon Elias Bibri; 2018. Smart Sustainable Cities of the Future: The Untapped Potential of Big Data Analytics and Context-Aware Computing for Advancing Sustainability. Springer. p. 74. .


Computer networks
This branch of computer science aims to manage networks between computers worldwide.


Computer security and cryptography
Computer security is a branch of computer technology with the objective of protecting information from unauthorized access, disruption, or modification while maintaining the accessibility and usability of the system for its intended users.

Historical is the art of writing and deciphering secret messages. Modern cryptography is the scientific study of problems relating to distributed computations that can be attacked.

(2023). 9781584885511, Chapman & Hall/CRC. .
Technologies studied in modern cryptography include symmetric and asymmetric , digital signatures, cryptographic hash functions, key-agreement protocols, , zero-knowledge proofs, and .


Databases and data mining
A database is intended to organize, store, and retrieve large amounts of data easily. Digital databases are managed using database management systems to store, create, maintain, and search data, through and . Data mining is a process of discovering patterns in large data sets.


Discoveries
The philosopher of computing Bill Rapaport noted three Great Insights of Computer Science:
: All the information about any computable problem can be represented using only 0 and 1 (or any other bistable pair that can flip-flop between two easily distinguishable states, such as "on/off", "magnetized/de-magnetized", "high-voltage/low-voltage", etc.).

  • 's insight: there are only five actions that a computer has to perform in order to do "anything".
: Every algorithm can be expressed in a language for a computer consisting of only five basic instructions:B. Jack Copeland, 2012. Alan Turing's Electronic Brain: The Struggle to Build the ACE, the World's Fastest Computer. OUP Oxford. p. 107. .
:* move left one location;
:* move right one location;
:* read symbol at current location;
:* print 0 at current location;
:* print 1 at current location.

  • Corrado Böhm and Giuseppe Jacopini's insight: there are only three ways of combining these actions (into more complex ones) that are needed in order for a computer to do "anything".Charles W. Herbert, 2010. An Introduction to Programming Using Alice 2.2. Cengage Learning. p. 122. .

: Only three rules are needed to combine any set of basic instructions into more complex ones:
:* sequence: first do this, then do that;
:* selection: IF such-and-such is the case, THEN do this, ELSE do that;
:* repetition: WHILE such-and-such is the case, DO this.
: Note that the three rules of Boehm's and Jacopini's insight can be further simplified with the use of (which means it is more elementary than structured programming).


Programming paradigms
Programming languages can be used to accomplish different tasks in different ways. Common programming paradigms include:

  • Functional programming, a style of building the structure and elements of computer programs that treats computation as the evaluation of mathematical functions and avoids state and mutable data. It is a declarative programming paradigm, which means programming is done with expressions or declarations instead of statements.Md. Rezaul Karim; Sridhar Alla; 2017. Scala and Spark for Big Data Analytics: Explore the concepts of functional programming, data streaming, and machine learning. Packt Publishing Ltd. p. 87. .
  • Imperative programming, a programming paradigm that uses statements that change a program's state.Lex Sheehan, 2017. Learning Functional Programming in Go: Change the way you approach your applications using functional programming in Go. Packt Publishing Ltd. p. 16. . In much the same way that the imperative mood in natural languages expresses commands, an imperative program consists of commands for the computer to perform. Imperative programming focuses on describing how a program operates.
  • Object-oriented programming, a programming paradigm based on the concept of "objects", which may contain data, in the form of fields, often known as attributes; and code, in the form of procedures, often known as methods. A feature of objects is that an object's procedures can access and often modify the data fields of the object with which they are associated. Thus object-oriented computer programs are made out of objects that interact with one another.Evelio Padilla, 2015. Substation Automation Systems: Design and Implementation. Wiley. p. 245. .
  • Service-oriented programming, a programming paradigm that uses "services" as the unit of computer work, to design and implement integrated business applications and software programs

Many languages offer support for multiple paradigms, making the distinction more a matter of style than of technical capabilities.


Research
Conferences are important events for computer science research. During these conferences, researchers from the public and private sectors present their recent work and meet. Unlike in most other academic fields, in computer science, the prestige of is greater than that of journal publications. One proposed explanation for this is the quick development of this relatively new field requires rapid review and distribution of results, a task better handled by conferences than by journals.


Education
Computer Science, known by its near synonyms, Computing, Computer Studies, has been taught in UK schools since the days of , and but usually to a select few students. In 1981, the BBC produced a micro-computer and and Computer Studies became common for GCE students (11–16-year-old), and Computer Science to students. Its importance was recognised, and it became a compulsory part of the National Curriculum, for Key Stage 3 & 4. In September 2014 it became an entitlement for all pupils over the age of 4.

In the US, with 14,000 school districts deciding the curriculum, provision was fractured. According to a 2010 report by the Association for Computing Machinery (ACM) and Computer Science Teachers Association (CSTA), only 14 out of 50 states have adopted significant education standards for high school computer science. According to a 2021 report, only 51% of high schools in the US offer computer science.

Israel, New Zealand, and South Korea have included computer science in their national secondary education curricula, and several others are following.


See also
  • Computer engineering
  • Computer programming
  • Digital Revolution
  • Information and communications technology
  • Information technology
  • List of computer scientists
  • List of computer science awards
  • List of important publications in computer science
  • List of pioneers in computer science
  • List of unsolved problems in computer science
  • Programming language
  • Software engineering


Notes

Further reading

Overview
  • (2023). 9781584883609, Chapman and Hall/CRC.
    • "Within more than 70 chapters, every one new or significantly revised, one can find any kind of information and references about computer science one can imagine. ... all in all, there is absolute nothing about Computer Science that can not be found in the 2.5 kilogram-encyclopaedia with its 110 survey articles ...." (Christoph Meinel, Zentralblatt MATH)
  • (1994). 9780262720205, The MIT Press.
    • "... this set is the most unique and possibly the most useful to the theoretical community, in support both of teaching and research .... The books can be used by anyone wanting simply to gain an understanding of one of these areas, or by someone desiring to be in research in a topic, or by instructors wishing to find timely information on a subject they are teaching outside their major areas of expertise." (Rocky Ross, )
  • (2023). 9781561592487, Grove's Dictionaries. .
    • "Since 1976, this has been the definitive reference work on computer, computing, and computer science. ... Alphabetically arranged and classified into broad subject areas, the entries cover hardware, computer systems, information and data, software, the mathematics of computing, theory of computation, methodologies, applications, and computing milieu. The editors have done a commendable job of blending historical perspective and practical reference information. The encyclopedia remains essential for most public and academic library reference collections." (Joe Accardin, Northeastern Illinois Univ., Chicago)
  • (2023). 9781573565219, Greenwood Publishing Group. .


Selected literature
  • (1990). 9780824000431, Garland Publishing Inc. .
  • (2023). 9780262531795, The MIT press.
  • (1973). 9783540061694, Springer-Verlag.
    • "Covering a period from 1966 to 1993, its interest lies not only in the content of each of these papers – still timely today – but also in their being put together so that ideas expressed at different times complement each other nicely." (N. Bernard, Zentralblatt MATH)


Articles
  • Peter J. Denning. Is computer science science?, Communications of the ACM, April 2005.
  • Peter J. Denning, Great principles in computing curricula, Technical Symposium on Computer Science Education, 2004.
  • Research evaluation for computer science, Informatics Europe report . Shorter journal version: Bertrand Meyer, Christine Choppy, Jan van Leeuwen and Jorgen Staunstrup, Research evaluation for computer science, in Communications of the ACM, vol. 52, no. 4, pp. 31–34, April 2009.


Curriculum and classification


External links


Bibliography and academic search engines


Professional organizations


Misc

Page 1 of 1
1
Page 1 of 1
1

Account

Social:
Pages:  ..   .. 
Items:  .. 

Navigation

General: Atom Feed Atom Feed  .. 
Help:  ..   .. 
Category:  ..   .. 
Media:  ..   .. 
Posts:  ..   ..   .. 

Statistics

Page:  .. 
Summary:  .. 
1 Tags
10/10 Page Rank
5 Page Refs
11s Time