Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Browse By

All Concepts

A Concept is one of the abstract building blocks of computing: an algorithm, a data structure, a theoretical result, or a named paradigm or principle that a field defines its claims in terms of, independent of any one language or system that implements it. Recursion, the sorting algorithm, the linked list, the Turing machine and object oriented programming as a paradigm are all Concepts. A Concept is not a Language or a System: a concept is the idea, which a language may express and a system may embody, but the idea itself is prior to and independent of either.

All Concepts
Filter Results218 entries

Heuristics

Technique

Huffman Coding

Algorithm

Imperative Programming

Paradigm

In-place algorithm

Algorithm

InterBase Public License

Software License

Intermediate Representation

Model

International Bank Account Number

Notation

International Mobile Equipment Identity

Notation

Interpreter Pattern

Technique

ISC License

Software License

ISSN

Notation

Iterative Refinement

Technique

Iterator Pattern

Technique

Julian day

Notation

Just-In-Time Compilation

Technique

Karatsuba Algorithm

Algorithm

Kernel (operating system)

Foundational Concept

K-Means Clustering

Algorithm

Knuth-Morris-Pratt Algorithm

Algorithm

Kolmogorov complexity

Foundational Concept

Lambda Calculus

Model

Leader Election

Technique

Lexical Analysis

Technique

Linked List

Data Structure

Load Balancing

Technique

Logic Programming

Paradigm

MapReduce

Model

Markov Decision Process

Model

MD5

Technique

Mediator Pattern

Technique

Memento Pattern

Technique

Merge Sort

Algorithm

Metaprogramming

Paradigm

Minimax Algorithm

Algorithm

MIT License

Software License

Moore's Law

Empirical Observation

Mutex

Technique

Neural Network

Model

Nondeterministic Finite Automaton

Model

NP (Complexity Class)

Complexity Class

NP-Completeness

Complexity Class

NP-Hard

Complexity Class

Object Oriented Programming

Paradigm

Observer Pattern

Technique

Overfitting

Foundational Concept

P (Complexity Class)

Complexity Class

P versus NP

Open Problem

Packet Switching

Technique

PageRank

Algorithm

Parallel Programming

Paradigm

Parsing

Technique

PostgreSQL License

Software License

Priority Queue

Data Structure

Producer-Consumer Problem

Foundational Concept

Proprietary Software

Software License

Prototype Pattern

Technique

Proxy Pattern

Technique

PSPACE

Complexity Class

Public Key Cryptography

Technique

Public-Domain Software

Software License

Pumping Lemma

Technique

Pushdown Automaton

Model

Python Software Foundation License 2.0

Software License

Queue

Data Structure

Quicksort

Algorithm

Rabin-Karp Algorithm

Algorithm

Race Condition

Foundational Concept

Randomized Algorithms

Technique

Reactive Programming

Paradigm

Recurrent Neural Network

Model

Recursion

Technique

Red-Black Tree

Data Structure

Refactoring

Technique

Register Allocation

Technique

Regular Expression

Notation

Reinforcement Learning

Paradigm

Relational Model

Model

RSA Algorithm

Algorithm

Secure Hash Algorithm

Technique

Segment Tree

Data Structure

Semaphore

Technique

Semiconductor

Physical Concept

Server Side Public License

Software License

Sharding

Technique

Simulated Annealing

Algorithm

Singleton Pattern

Technique

Skip List

Data Structure

SOLID Principles

Technique

Stack

Data Structure

State Pattern

Technique

Static Typing

Foundational Concept

Strategy Pattern

Technique

String (computer science)

Data Structure

Strong Typing

Foundational Concept

Structured Programming

Paradigm

Suffix Array

Data Structure

Suffix Tree

Data Structure

Sun Public License

Software License

Supervised Learning

Paradigm

Support Vector Machine

Model
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.