Share This
table started by
Freebase Staff for the Computer Science Base
Topic is one of the core types in Freebase. Topics contain a set of default properties that are generally useful when describing a topic: display name, alias, article, image and webpage.
Most types in Freebase carry these topic properties by default. If an item in Freebase is typed 'topic' it...
more
Add More Topics
Save this view to a base, or just for yourself.
about 2,000 Topic topics matching:
Filter this Collection|
|
||||
|---|---|---|---|---|
| x name | x image | x Also known as | x article | x Subjects |
| Ada Lovelace |
|
Ada Byron |
Augusta Ada King, Countess of Lovelace (10 December 1815, London – 27 November 1852, Marylebone, London), born Augusta Ada Byron, was the only legitimate child of poet Lord Byron. She is widely known in modern times simply as Ada Lovelace.
She is...
|
|
| The Right Honourable Augusta Ada, Countess of Lovelace | ||||
| Augusta Ada King | ||||
| Augusta Ada Byron | ||||
| Artificial intelligence |
|
Machine Intelligence |
Artificial intelligence (AI) is the intelligence of machines and the branch of computer science which aims to create it. Textbooks define the field as "the study and design of intelligent agents," where an intelligent agent is a system that...
|
|
| AI | ||||
| Alan Turing |
|
Alan Mathison Turing |
Alan Mathison Turing, OBE, FRS (pronounced /ˈtjʊərɪŋ/, TYOOR-ing; 23 June 1912 – 7 June 1954), was an English mathematician, logician, cryptanalyst, and computer scientist. He was influential in the development of computer science and providing a...
|
|
| Advanced Encryption Standard | Rijndael |
In cryptography, the Advanced Encryption Standard (AES) is an encryption standard adopted by the U.S. government. The standard comprises three block ciphers, AES-128, AES-192 and AES-256, adopted from a larger collection originally published as...
|
||
| Alan Kay |
|
Alan Curtis Kay |
Alan Curtis Kay (born May 17, 1940) is an American computer scientist, known for his early pioneering work on object-oriented programming and windowing graphical user interface design, and for coining the phrase, "The best way to predict the future...
|
|
| Kolmogorov complexity |
|
In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity (also known as descriptive complexity, Kolmogorov-Chaitin complexity, stochastic complexity, algorithmic entropy, or program-size complexity) of an object...
|
||
| Array |
In computer science, an array data structure or simply array is a data structure consisting of a collection of elements (values or variables), each identified by one or more integer indices, stored so that the address of each element can be computed...
|
|||
| AVL tree |
|
In computer science, an AVL tree is a self-balancing binary search tree, and it is the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; therefore, it is also said to...
|
||
| Andrew S. Tanenbaum |
|
Andrew Stuart "Andy" Tanenbaum (sometimes referred to by the handle ast) (born March 16, 1944) is a professor of computer science at the Vrije Universiteit, Amsterdam in the Netherlands. He is best known as the author of MINIX, a free Unix-like...
|
||
| Blowfish |
|
Blowfish is a keyed, symmetric block cipher, designed in 1993 by Bruce Schneier and included in a large number of cipher suites and encryption products. Blowfish provides a good encryption rate in software and no effective cryptanalysis of it has...
|
||
| Bill Joy |
|
William Nelson Joy |
Bill Joy, longtime KP Limited Partner, joined KPCB as Partner in January 2005.At
KP he helps entrepreneurs advance the Internet, develop wireless
innovations, and find new ways of using large scale computing to solve
the most difficult problems. He...
|
|
| Brian Kernighan |
Brian Wilson Kernighan (pronounced /ˈkɛrnɪhæn/, the 'g' is silent), (born January 1942, Toronto, Ontario, Canada) is a computer scientist who worked at Bell Labs alongside Unix creators Ken Thompson and Dennis Ritchie and contributed greatly to Unix...
|
|||
| BPP |
In complexity theory, BPP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability of at most 1/3 for all instances. The abbreviation BPP refers to Bounded-error, Probabilistic,...
|
|||
| BQP |
In computational complexity theory BQP stands for Bounded error, Quantum, Polynomial time. It denotes 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...
|
|||
| Bioinformatics |
|
Computational Biology |
Bioinformatics
and computational biology involve the use of techniques including
applied mathematics, informatics, statistics, computer science,
artificial intelligence, chemistry and biochemistry to solve biological
problems usually on the...
|
|
| Binary search tree |
In computer science, a binary search tree (BST) is a node based binary tree data structure which has the following properties:
From the above properties it naturally follows that:
Generally, the information represented by each node is a record...
|
|||
| Binary tree |
In computer science, a binary tree is a tree data structure in which each node has at most two children. Typically the first node is known as the parent and the child nodes are called left and right. In type theory, a binary tree with nodes of type...
|
|||
| B-tree |
|
In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, insertions, deletions, and sequential access in logarithmic amortized time. The B-tree is a generalization of a binary search tree in that more than...
|
||
| Boolean satisfiability problem |
Satisfiability is the problem of determining if the variables of a given Boolean formula can be assigned in such a way as to make the formula evaluate to TRUE. Equally important is to determine whether no such assignments exist, which would imply...
|
|||
| Cryptography |
|
Cryptography (or cryptology; from Greek κρυπτός, kryptos, "hidden, secret"; and γράφω, gráphō, "I write", or -λογία, -logia, respectively) is the practice and study of hiding information. Modern cryptography intersects the disciplines of mathematics...
|
||
| Computational linguistics |
Computational linguistics is an interdisciplinary field dealing with the statistical and/or rule-based modeling of natural language from a computational perspective. This modeling is not limited to any particular field of linguistics. Traditionally,...
|
|||
| Computer networking |
|
Computer networking is the engineering discipline concerned with communication between computer systems or devices. Networking, routers, routing protocols, and networking over the public Internet have their specifications defined in documents called...
|
||
| Claude Elwood Shannon |
|
Claude Shannon |
Claude Elwood Shannon (April 30, 1916 – February 24, 2001), an American electronic engineer and mathematician, is known as "the father of information theory".
Shannon is famous for having founded information theory with one landmark paper published...
|
|
| Claude E. Shannon | ||||
| Co-NP |
In computational complexity theory, co-NP is a complexity class. A problem is a member of co-NP if and only if its complement is in complexity class NP. In simple terms, co-NP is the class of problems for which efficiently verifiable proofs of no...
|
|||
| Context-sensitive grammar |
A context-sensitive grammar (CSG) is a formal grammar in which the left-hand sides and right-hand sides of any production rules may be surrounded by a context of terminal and nonterminal symbols. Context-sensitive grammars are more general than...
|
|||
| Context-sensitive language |
In theoretical computer science, a context-sensitive language is a formal language that can be defined by a context-sensitive grammar. That is one of the four types of grammars in the Chomsky hierarchy. Of the four, this is the least often used, in...
|
|||
| Context-free grammar |
In formal language theory, a context-free grammar (CFG) is a grammar in which every production rule is of the form
where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (possibly empty).
Thus, the difference with...
|
|||
| Context-free language |
In formal language theory, a context-free language is a language generated by some context-free grammar. The set of all context-free languages is identical to the set of languages accepted by pushdown automata.
An archetypical context-free language...
|
|||
| Computer security |
|
Computer security is a branch of computer technology known as information security as applied to computers and networks. The objective of computer security includes protection of information and property from theft, corruption, or natural disaster,...
|
||
| Complex instruction set computer |
A complex instruction set computer (CISC, pronounced like "sisk") is a computer instruction set architecture (ISA) in which each instruction can execute several low-level operations, such as a load from memory, an arithmetic operation, and a memory...
|
|||
| Diffie-Hellman key exchange |
|
Diffie–Hellman key exchange (D–H) is a cryptographic protocol that allows two parties that have no prior knowledge of each other to jointly establish a shared secret key over an insecure communications channel. This key can then be used to encrypt...
|
||
| Data Encryption Standard |
|
The Data Encryption Standard (DES) is a block cipher (a form of shared secret encryption) that was selected by the National Bureau of Standards as an official Federal Information Processing Standard (FIPS) for the United States in 1976 and which has...
|
||
| Douglas Engelbart |
|
Dr. Douglas C. Engelbart |
Dr. Douglas C. Engelbart (born January 30, 1925) is an American inventor and early computer pioneer. He is best known for inventing the computer mouse, as a pioneer of human-computer interaction whose team developed hypertext, networked computers,...
|
|
| Donald Knuth |
|
Don Knuth |
Donald Ervin Knuth (pronounced /kəˈnuːθ/) (born January 10, 1938) is a renowned computer scientist and Professor Emeritus of the Art of Computer Programming at Stanford University.
Author of the seminal multi-volume work The Art of Computer...
|
|
| Donald Ervin Knuth | ||||
| Dennis Ritchie |
|
dmr |
Dennis MacAlistair Ritchie (username: dmr, born September 9, 1941) is an American computer scientist notable for his influence on C and other programming languages, and on operating systems such as Multics and Unix. He received the Turing Award in...
|
|
| Deque |
|
In computer science, a double-ended queue (often abbreviated to deque, pronounced deck) is an abstract data structure that implements a queue for which elements can only be added to or removed from the front (head) or back (tail). It is also often...
|
||
| David A. Huffman |
David Albert Huffman (August 9, 1925 – October 7, 1999) was a pioneer in the computer science field.
Throughout his life, Huffman made significant contributions to the study of finite state machines, switching circuits, synthesis procedures, and...
|
|||
| DEC Alpha |
|
Alpha, originally known as Alpha AXP, was a 64-bit reduced instruction set computer (RISC) instruction set architecture (ISA) developed by Digital Equipment Corporation (DEC), designed to replace the 32-bit VAX complex instruction set computer (CISC...
|
||
| Edsger Dijkstra |
|
Edsger Wybe Dijkstra |
Edsger Wybe Dijkstra (May 11, 1930 – August 6, 2002; Dutch pronunciation: [ˈɛtsxər ˈwibə ˈdɛɪkstra] ( listen)) was a Dutch computer scientist. He received the 1972 Turing Award for fundamental contributions to developing programming languages, and...
|
|
| Dijkstra | ||||
| Fred Brooks |
|
Frederick P. Brooks |
Frederick Phillips Brooks, Jr. (born April 19, 1931) is a software engineer and computer scientist, best-known for managing the development of OS/360, then later writing candidly about the process in his seminal book The Mythical Man-Month. "It is a...
|
|
| Frederick Phillips Brooks, Jr. | ||||
| Grace Hopper |
|
Grace Murray Hopper |
Rear Admiral Grace Murray Hopper (December 9, 1906 – January 1, 1992) was an American computer scientist and United States Naval officer. A pioneer in the field, she was one of the first programmers of the Harvard Mark I computer, and she developed...
|
|
| Amazing Grace | ||||
| Gary Kildall |
|
Gary Arlen Kildall (May 19, 1942 – July 11, 1994) was an American computer scientist and microcomputer entrepreneur who created the CP/M operating system and founded Digital Research, Inc. (DRI). Kildall was one of the first people to see...
|
||
| Harald Tveit Alvestrand |
|
Harald Tveit Alvestrand (born 29 June 1959) is a Norwegian computer scientist. He was the chairman of the Internet Engineering Task Force from 2001 until 2005. He is an author of several important RFCs, many in the general area of...
|
||
| Human–computer interaction | Human Computer Interaction |
Human–computer interaction (HCI) is the study of interaction between people (users) and computers. It is often regarded as the intersection of computer science, behavioral sciences, design and several other fields of study. Interaction between users...
|
||
| Halting problem |
In computability theory, the halting problem is a decision problem which can be stated as follows: given a description of a program, decide whether the program finishes running or will run forever. This is equivalent to the problem of deciding,...
|
|||
| Hash table |
In computer science, a hash table or hash map is a data structure that uses a hash function to efficiently map certain identifiers or keys (e.g., person names) to associated values (e.g., their telephone numbers). The hash function is used to...
|
|||
| Heap |
|
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if B is a child node of A, then key(A) ≥ key(B). Also the tree data structure must be a complete tree for satisfying the heap property. This...
|
||
| Herbert Simon |
|
Herbert Alexander Simon |
Herbert Alexander Simon (June 15, 1916– February 9, 2001) was an American political scientist, economist, and psychologist, and professor—most notably at Carnegie Mellon University—whose research ranged across the fields of cognitive psychology,...
|
|
| Herbert A Simon | ||||
| x86-32 (32 bit Intel x86) |
|
x86-32 |
IA-32 (Intel Architecture, 32-bit), often generically called x86, x86-32 or i386, is the instruction set architecture of Intel's most commercially successful microprocessors yet. It is a 32-bit extension, first implemented in the Intel 80386, of the...
|
|
| IA-32 | ||||
| International Data Encryption Algorithm |
|
In cryptography, the International Data Encryption Algorithm (IDEA) is a block cipher designed by James Massey of ETH Zurich and Xuejia Lai and was first described in 1991. The algorithm was intended as a replacement for the Data Encryption Standard...
|
||
| Jon Postel |
|
Jonathan Bruce Postel (pronounced /pəˈstɛl/; August 6, 1943 – October 16, 1998) made many significant contributions to the development of the Internet, particularly with respect to standards. He is known principally for being the Editor of the...
|
||
| Joyce K. Reynolds |
Joyce K. Reynolds is a computer scientist.
Reynolds holds bachelor's and master's degrees from the University of Southern California, United States. She has been active in the development of the protocols underlying the Internet. In particular, she...
|
|||
| Ken Thompson |
|
Kenneth Lane Thompson |
Ken Thompson (born February 4, 1943), commonly referred to as ken in hacker circles, is an American pioneer of computer science notable for his work with the B programming language and his shepherding of the Unix and Plan 9 operating systems. Most...
|
|
| Konrad Zuse |
|
Konrad Zuse (pronounced [ˈkɔnʁat ˈtsuːzə]; 22 June 1910 Berlin - 18 December 1995 Hünfeld) was a German engineer and computer pioneer. His greatest achievement was the world's first functional program-controlled Turing-complete computer, the Z3, in...
|
||
| Knapsack problem |
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than a given...
|
|||
| Linked list |
|
In computer science, a linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains a reference (i.e., a link) to the next record in the sequence.
Linked lists are among the...
|
||
| MD5 |
In cryptography, MD5 (Message-Digest algorithm 5) is a widely used cryptographic hash function with a 128-bit hash value. As an Internet standard (RFC 1321), MD5 has been employed in a wide variety of security applications, and is also commonly used...
|
|||
| Marvin Minsky |
|
Old Man Minsky |
Marvin Lee Minsky (born August 9, 1927) is an American cognitive scientist in the field of artificial intelligence (AI), co-founder of Massachusetts Institute of Technology's AI laboratory, and author of several texts on AI and philosophy.
Marvin...
|
|
| Marvin Lee Minsky | ||||
| MIPS architecture |
|
MIPS (originally an acronym for Microprocessor without Interlocked Pipeline Stages) is a reduced instruction set computer (RISC) instruction set architecture (ISA) developed by MIPS Computer Systems (now MIPS Technologies). The early MIPS...
|
||
| Michael Stonebraker |
|
Dr. Stonebraker has been a pioneer of database research and technology
for more than a quarter of a century. He was the main architect of the
INGRES relational DBMS, and the object-relational DBMS, POSTGRES. These
prototypes were developed at the...
|
||
