Difference between revisions of "Computer science"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) |
||
| Line 67: | Line 67: | ||
* [[Login session]] | * [[Login session]] | ||
* [[Model-view-controller]] | * [[Model-view-controller]] | ||
| + | * [[Non-deterministic Turing machine]] | ||
* [[Non-strict programming language]] | * [[Non-strict programming language]] | ||
* [[Normal form (abstract rewriting)]] | * [[Normal form (abstract rewriting)]] | ||
| Line 89: | Line 90: | ||
* [[Statement (computer science)]] | * [[Statement (computer science)]] | ||
* [[Strict programming language]] | * [[Strict programming language]] | ||
| + | * [[Turing completeness]] | ||
* [[Turing machine]] | * [[Turing machine]] | ||
* [[Universal Turing machine]] | * [[Universal Turing machine]] | ||
Revision as of 12:14, 2 March 2016
Computer science is the scientific and practical approach to computation and its applications.
Contents
Description
Computer science is the systematic study of the feasibility, structure, expression, and mechanization of the methodical procedures (or algorithms) that underlie the acquisition, representation, processing, storage, communication of, and access to information
Information may be encoded in a wide range of media:
- Bits in computer memory
- Genes and protein structures in a biological cell
- Etc.
Automated algorithms that scale
An alternate, more succinct definition of computer science is the study of automating algorithmic processes that scale.
Computer scientist
A computer scientist specializes in the theory of computation and the design of computational systems.
See also
- Abstract data type
- Abstract machine
- Abstraction (computer science)
- Abstract syntax
- Abstract syntax tree
- Ajax (programming)
- Backus–Naur Form
- Bit
- Canonical form
- Chaos theory
- Character (computing)
- Checksum
- Computation
- Computer
- Computer program
- Computer programming
- Computing
- Constant (computer programming)
- Control flow
- Data (computing)
- Database
- Database normalization
- Data structure
- Data type
- Data validation
- Distributed computing
- Dijkstra, Edsger Wybe
- Document classification
- Expression (computer science)
- Expression (mathematics)
- Graph theory
- Idempotence
- Identifier
- Information
- Information architecture
- Information theory
- Input (computing)
- Intermediate language
- Lambda calculus
- Lazy evaluation
- Lexical analysis
- Linked list
- localhost
- Local variable
- Logic in computer science
- Login session
- Model-view-controller
- Non-deterministic Turing machine
- Non-strict programming language
- Normal form (abstract rewriting)
- NP-completeness
- Parallel computation with molecular-motor-propelled agents in nanofabricated networks
- Parsing
- Power of two
- Programming language
- Programming language theory
- Random access
- Recursion
- Recursive definition
- Relational database
- Rewriting
- Round-off error
- Scalability
- Sequence
- Session (computer science)
- Software engineering
- State (computer science)
- Stateless protocol
- Statement (computer science)
- Strict programming language
- Turing completeness
- Turing machine
- Universal Turing machine
- Value (computer science)
- Van Wijngaarden grammar
- Vulnerability (computing)
- Zero-based numbering
External links
- Computer science @ Wikipedia
