CZ:Core Articles/Computers

Highest priority  Linked list: In computer science, a type of ordered collection in which each item contains a reference to the item that follows it. [e]  Regular Language: In computing theory, one that is accepted by a finite automaton. [e]  Turing Machine: A theoretical computing device, first posited by mathematician Alan Turing, which has been used extensively in analyzing computing problems such as tractability and complexity theory. [e] **  Interpreter (computer): In computer science, anything that turns one set of instructions into another set of instructions that are then immediately (or nearly immediately) executed. In the abstract sense, "instructions" can be anything, from operating system commands to a specific programming language (such as Python) [e]  Virtual memory: A concept in computer science whereby an operating system can use alternate (usually slower) data storage to impersonate real memory and run programs that ordinarily would not fit into real memory (RAM) [e] High priority  Halting problem: The task to decide whether a certain computer (executing a certain program) will eventually stop. [e]  Database: A collection of computer-readable records, at one or more location, that are organized in some meaningful way beyond simple sequence of creation [e] Threading: Add brief definition or description Liquid Crystal Display: Add brief definition or description Data types: Add brief definition or description includes static vs. dynamic, mention of inference, and other appropriate parts of Wikipedia's [[Data types}}, [[Type system}} and [[Type theory}} Floating point: Add brief definition or description  Machine learning: Process or technique by which an object modifies its own behavior as the result of its past experience and performance, and/or the self-acquisition of new data. [e] Software testing: Add brief definition or description  String (computing): In computing and more specifically in various programming languages, a variable type that can hold text [e]  Two's complement: Add brief definition or description Mid-priority Binary Tree: Add brief definition or description Priority queue: Add brief definition or description Chomsky hierarchy: Add brief definition or description Depth-first search: Add brief definition or description Dynamic programming: Add brief definition or description Random Access Machine: Add brief definition or description Stacks and queues: Add brief definition or description Cache: Add brief definition or description Process: Add brief definition or description in the context of an operating system  Structured Query Language: Simple language designed for querying and managing relational databases. [e] Computer Keyboard: Add brief definition or description Computer Mouse: Add brief definition or description  Hard disk: The physical device in most modern computers that holds large amounts of data on a permanent basis, using magnetic media on a rapidly rotating circular platter. [e] Abstract data type: Add brief definition or description  Alan Turing: British mathematician, code breaker and computer pioneer. [e] ACM: Add brief definition or description EFI: Add brief definition or description Turing Award: Prestigious award in computer science, presented by the Association for Computing Machinery [e]

Theory, algorithms, data structures and Languages B-Tree: Add brief definition or description Red-Black tree: Add brief definition or description Skip list: Add brief definition or description Branch and bound: Add brief definition or description Breadth-first search: Add brief definition or description Decidability theory: Add brief definition or description Finite state machine: Add brief definition or description  Fast Fourier transform: Add brief definition or description Huffman code: Add brief definition or description  Lambda calculus: Add brief definition or description Minimum spanning tree: Add brief definition or description Min cut and max flow: Add brief definition or description Monte Carlo algorithm: Add brief definition or description Order statistics (algorithms): Add brief definition or description i.e. median  Recurrence relation: Add brief definition or description Relational algebra: Add brief definition or description Shortest path: Add brief definition or description (includes Dijkstra's algorithm) Ada programming language: Add brief definition or description Debugging: Add brief definition or description Eiffel programming language: Add brief definition or description Forth programming language: Add brief definition or description Fortran programming language: Add brief definition or description  Haskell programming language: Add brief definition or description ML programming language: Add brief definition or description Object oriented: Add brief definition or description in the context of programming languages Prolog programming language: Add brief definition or description Type inference: Add brief definition or description  ASCII: Add brief definition or description Bit: Add brief definition or description (or should that be redirect to [[Binary numeral system}}?) Capatcha: Add brief definition or description Computational Biology: Add brief definition or description  Computer program: Add brief definition or description Linear programming: Add brief definition or description

Systems, networking, and misc Computer vision: Add brief definition or description  Geometric computing: Add brief definition or description ** GPL: Add brief definition or description Grid computing: Add brief definition or description Software standards: Add brief definition or description Software verification: Add brief definition or description  Unicode: Add brief definition or description  Bandwidth: Add brief definition or description Throughput: Add brief definition or description  File Transfer Protocol: Add brief definition or description  Latency: Add brief definition or description Computer Virus: Add brief definition or description  Ethernet: Add brief definition or description Graphical User Interface: Add brief definition or description Lock (computing): Add brief definition or description Pipelining: Add brief definition or description Semaphore (computing): Add brief definition or description Transactional memory: Add brief definition or description Universal Serial Bus: Add brief definition or description a.k.a. USB  Random Access Memory: Add brief definition or description Wireless Networking: Add brief definition or description Cathode Ray Tube: Add brief definition or description Memory management unit: Add brief definition or description ANSI: Add brief definition or description  IEEE: Add brief definition or description IETF: Add brief definition or description ISO: Add brief definition or description World Wide Web Consortium: Add brief definition or description ** Frances Allen: Add brief definition or description Alonzo Church: Add brief definition or description Kurt Goedel: Add brief definition or description Richard Karp: Add brief definition or description  Robert Tarjan: Add brief definition or description

Not quite important enough?

Simple Mail Transfer Protocol: Add brief definition or description several topics to consider at List of topics in software engineering People Ada Lovelace The Anti-Kythera Mechanism Is this really important enough? Warren Schudy 20:22, 8 January 2008 (CST) Theory Planar Graph Probably not important enough Warren Schudy 18:35, 8 January 2008 (CST) Theory Probabilistically checkable proof PCP theorem is important for current research, but maybe not top-100 Warren Schudy 20:22, 8 January 2008 (CST) standards organizations: , WS-I, etc. Languages Erlang programming language Languages OCaml programming language Systems Microprocessor (we already have CPU) Data Fibonacci heap Theory Graph theory (important, but removed from here because it's in the math list. If math removes it from theirs, we should add it back to ours.)