Concurrency (computer science)In computer science, concurrency refers to the ability of a system to execute multiple tasks through simultaneous execution or time-sharing (context switching), sharing resources and managing interactions.
ComputingComputing is any goal-oriented activity that requires, benefits from, or creates computing machinery. It includes the study and experimentation of algorithmic processes, and the development of both hardware and software. Computing encompasses scientific, engineering, mathematical, technological, and social aspects.
Per Brinch HansenPer Brinch Hansen (13 November 1938 – 31 July 2007) was a Danish-Americancomputer scientist known for his work in operating systems, concurrentprogramming and parallel and distributed computing. BiographyEarly life and educationPer Brinch Hansen was born in Frederiksberg, an enclave surrounded by Copenhagen, Denmark.
ComputationA computation is any type of arithmetic or non-arithmetic calculation that is well-defined. Common examples of computation are mathematical equation solving and the execution of computer algorithms. Mechanical or electronic devices (or, historically, people) that perform computations are known as computers. Computer science is an academic field that involves the study of computation.
Computer programA computer program is a sequence or set of instructions in a programming language for a computer to execute. It is one component of software, which also includes documentation and other intangible components. A computer program in its human-readable form is called source code. Source code needs another computer program to execute because computers can only execute their native machine instructions.
Programming paradigmA programming paradigm is a relatively high-level way to conceptualize and structure the implementation of a computer program. A programming language can be classified as supporting one or many paradigms. Paradigms are separated along and described by different dimensions of programming. Some paradigms are about implications of the execution model, such as allowing side effects, or whether the sequence of operations is defined by the execution model.
Computer networkMetricsAlgorithmsCentralityGroup centralityDegreeMotifClusteringDegree distributionAssortativityDistanceModularityEfficiency ModelsListsCategoriesTopicsSoftwareNetwork scientistsIn computer science, computer engineering, and telecommunications, a network is a group of communicating computers and peripherals known as hosts, which communicate data to other hosts via communication protocols, as facilitated by networking hardware.
ComputerProgrammable machine that processes dataComputers and computing devices from different eras—left to right, top to bottom: Early vacuum-tube computer (ENIAC)Mainframe computer (IBM System/360)Smartphone (LYF Water 2)Desktop computer (IBM ThinkCentre S50 with monitor)Supercomputer (IBM Summit)A computer is a machine that can be programmed to automatically carry out sequences of arithmetic or logical operations (computation).
Decomposition (computer science)In computer science, decomposition is the process of identifying and organising a complex system into smaller components or layers of abstraction. Decomposition is the opposite process of composition, and is often used in object-oriented programming (OOP), structured programming, and structured analysis. A decomposition paradigm in software engineering is a strategy for organising a program as a number of parts, and usually implies a specific way to organise source code.
Tony HoareSir Charles Antony Richard Hoare ( ; 11 January 1934 – 5 March 2026), known as Sir Tony Hoare or C. A. R. Hoare, was a British computer scientist who made foundational contributions to programming languages, algorithms, operating systems, formal verification, and concurrent computing. His work earned him the 1980 ACM Turing Award, usually regarded as the highest distinction in computer science. Hoare developed the sorting algorithmquicksort in 1959–1960.Modular programmingModular programming is a programming paradigm that emphasizes organizing the functions of a codebase into independent modules, each providing an aspect of a computer program in its entirety without providing other aspects. A module interface expresses the elements that are provided and required by the module. The elements defined in the interface are detectable by other modules.
Edsger W. DijkstraEdsger Wybe Dijkstra ( ; Dutch:; 11 May 1930 – 6 August 2002) was a Dutch computer scientist, programmer, mathematician, and science essayist. Born in Rotterdam in the Netherlands, Dijkstra studied mathematics and physics and then theoretical physics at the University of Leiden. Adriaan van Wijngaarden offered him a job as the first computer programmer in the Netherlands at the Mathematical Centre in Amsterdam, where he worked from 1952 until 1962.*As an Amazon Associate I earn from qualifying purchases.