A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are computations performed by computers, in which the fixed set of rules may be the functions provided by a particular programming language.
The field of computer science studies the nature of computation and its uses, among other things. A set of rules used to carry out a computation is known as an algorithm.
See alsoAlgorithm,
Automata Theory,
Cellular Automaton,
Computation Time,
Computational Irreducibility,
Computational Reducibility,
Generalized Mobile Automaton,
Mobile Automaton,
Principle of Computational Equivalence,
Register Machine,
Turing MachineThis entry contributed by Todd Rowland
Explore with Wolfram|Alpha ReferencesWolfram, S. "The Notion of Computation." Ch. 11 in A New Kind of Science. Champaign, IL: Wolfram Media, pp. 637-714, 2002. Referenced on Wolfram|AlphaComputation Cite this as:Rowland, Todd. "Computation." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/Computation.html
Subject classificationsRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.3