* 1926 – Kristen Nygaard, Norwegian computer scientist ( d. 2002 )

* 1943 – Jon Postel, American computer scientist ( d. 1998 )

* 1925 – David A. Huffman, American computer scientist, developed the Huffman coding ( d. 1999 )

* 1927 – Marvin Minsky, American computer scientist

Alan Mathison Turing, OBE, FRS ( ; 23 June 1912 – 7 June 1954 ), was a British mathematician, logician, cryptanalyst, and computer scientist.

* 1951 – Eric Goles, Chilean mathematician and computer scientist

* 1973 – Sergey Brin, Russian-American computer scientist and businessman, co-founded of Google

* 1923 – Edgar F. Codd, English computer scientist ( d. 2003 )

* 1950 – Steve Wozniak, American computer scientist and programmer, co-founded Apple Inc.

* 2002 – Kristen Nygaard, Norwegian computer scientist and politician ( b. 1926 )

The President of the ACM for 2012 – 2014 is Vint Cerf, an American computer scientist, who is recognized as one of " the fathers of the Internet ".

Bjarne Stroustrup (); born December 30, 1950 in Århus, Denmark ) is a Danish computer scientist, most notable for the creation and the development of the widely used C ++ programming language.

Brian Wilson Kernighan (; born 1942 ) is a Canadian computer scientist who worked at Bell Labs alongside Unix creators Ken Thompson and Dennis Ritchie and contributed to the development of Unix.

The term programmer can be used to refer to a software developer, software engineer, computer scientist, or software analyst.

A computer scientist is a person who does work at a professional level in computer science and / or has attained a degree in computer science or a related field.

One of the most influential contributions to this question was an essay written in 1950 by pioneering computer scientist Alan Turing, titled Computing Machinery and Intelligence.

* Peter Nordin, computer scientist and entrepreneur

* Christopher Ahlberg, computer scientist and entrepreneur

* Ivar Jacobson, computer scientist

* Ludvig Strigeus, computer scientist and entrepreneur

* Per Håkan Sundell, computer scientist and entrepreneur

A Pattern Language: Towns, Buildings, Construction ( 1977 ) described a practical architectural system in a form that a theoretical mathematician or computer scientist might call a generative grammar.

* CDW, one of the world's largest privately held companies that specialises in computer hardware, software and supplies, is based out of Vernon Hills.

This university specialises in microelectronics, precision mechanics, computer sciences and other faculties.

Clondalkin also plays host to a large number of online businesses including well known websites such as Elara-a company who specialises in the supply of computer hardware and related products, Get Broadband-broadband comparison website, Office Spot-office supplies and stationery company, Hosting 365-website hosting and domain registration company, and Dublinplumber-plumbing company founded in Clondalkin.

Geoff Crammond is a computer game designer and programmer who specialises in motor racing games.

Boroughbridge High School specialises in performing arts and has a library, computer rooms and a drama studio.

In algorithmic information theory ( a subfield of computer science ), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object.

Algorithmic information theory is the area of computer science that studies Kolmogorov complexity and other complexity measures on strings ( or other data structures ).

In computational complexity theory, BQP ( bounded error quantum polynomial time ) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1 / 3 for all instances.

In the past two decades computer analysis has contributed significantly to chess theory as understood by human players, particularly in the endgame.

Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, and combinatorics also has many applications in optimization, computer science, ergodic theory and statistical physics.

Some, such as computational complexity theory, which studies fundamental properties of computational problems, are highly abstract, while others, such as computer graphics, emphasize real-world applications.

For example, programming language theory studies approaches to description of computations, while the study of computer programming itself investigates various aspects of the use of programming languages and complex systems, and human-computer interaction focuses on the challenges in making computers and computations useful, usable, and universally accessible to humans.

In information theory and computer science, a code is usually considered as an algorithm which uniquely represents symbols from some source alphabet, by encoded strings, which may be in some other target alphabet.

Some fields, such as computational complexity theory ( which explores the fundamental properties of computational problems ), are highly abstract, whilst fields such as computer graphics emphasise real-world applications.

For example, programming language theory considers various approaches to the description of computation, whilst the study of computer programming itself investigates various aspects of the use of programming language and complex systems.

Another precursor was the early development of the theory of computation and the digital computer in the 1940s and 1950s.

As the field is highly interdisciplinary, research often cuts across multiple areas of study, drawing on research methods from psychology, neuroscience, computer science and systems theory.

The impact of valence theory declined during the 1960s and 1970s as molecular orbital theory grew in usefulness as it was implemented in large digital computer programs.

Since the 1980s, the more difficult problems of implementing valence bond theory into computer programs have been solved largely, and valence bond theory has seen a resurgence.

* Computational complexity theory, a field in theoretical computer science and mathematics

In the computer science subfield of algorithmic information theory, a Chaitin constant ( Chaitin omega number ) or halting probability is a real number that informally represents the probability that a randomly constructed program will halt.

As a scientific discipline, computer vision is concerned with the theory behind artificial systems that extract information from images.

Much of the work on computer music has drawn on the relationship between music theory and mathematics.

Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.

Closely related fields in theoretical computer science are analysis of algorithms and computability theory.