Array ( [0] => {{short description|Any type of calculation}} [1] => A '''computation''' is any type of [[arithmetic]] or non-arithmetic [[calculation]] that is well-defined.[http://www.merriam-webster.com/dictionary/computation Computation] from the Free Merriam-Webster Dictionary{{cite web|title=Computation: Definition and Synonyms from Answers.com|url=http://www.answers.com:80/topic/computation|website=Answers.com|access-date=26 April 2017|archive-url=https://web.archive.org/web/20090222005439/http://www.answers.com/topic/computation|archive-date=22 February 2009|url-status=dead}} Common examples of computation are [[mathematical equation|mathematical equation]] solving and the [[Execution (computing)|execution]] of computer [[algorithms]]. [2] => [3] => Mechanical or electronic devices (or, [[History of computing hardware|historically]], people) that perform computations are known as ''[[computer]]s''. The study of computation is the field of [[computability]], itself a sub-field of [[computer science]] and [[mathematical logic]]. [4] => [5] => == Introduction == [6] => The notion that mathematical statements should be 'well-defined' had been argued by mathematicians since at least the [[1600s (decade)|1600s]],{{cite book | last=Couturat | first=Louis | title=la Logique de Leibniz a'Après des Documents Inédits | publisher=Paris | date=1901 | isbn=978-0343895099}} but agreement on a suitable definition proved elusive.{{cite book | last1=Davis | first1=Martin | last2=Davis | first2=Martin D. | title=The Universal Computer | publisher=W. W. Norton & Company | date=2000 | isbn=978-0-393-04785-1}} A candidate definition was proposed independently by several mathematicians in the 1930s.{{cite book | last=Davis | first=Martin | title=Computability & Unsolvability | publisher=Courier Corporation | date=1982-01-01 | isbn=978-0-486-61471-7}} The best-known variant was formalised by the mathematician [[Alan Turing]], who defined a well-defined statement or calculation as any statement that could be expressed in terms of the initialisation parameters of a [[Turing machine]].{{Cite news | last= Turing | first= A.M. |year = 1937 | title = On Computable Numbers, with an Application to the Entscheidungsproblem | orig-year = Delivered to the Society November 1936 | periodical = Proceedings of the London Mathematical Society | series = 2 | volume = 42 | pages = 230–65 | doi= 10.1112/plms/s2-42.1.230 | url = http://www.comlab.ox.ac.uk/activities/ieg/e-library/sources/tp2-ie.pdf }} Other (mathematically equivalent) definitions include [[Alonzo Church]]'s ''[[Lambda calculus|lambda-definability]]'', [[Herbrand]]-[[Gödel]]-[[Kleene]]'s ''[[General recursive function|general recursiveness]]'' and [[Emil Post]]'s ''1-definability''. [7] => [8] => Today, any formal statement or calculation that exhibits this quality of well-definedness is termed '''computable''', while the statement or calculation itself is referred to as a '''computation'''. [9] => [10] => Turing's definition apportioned "well-definedness" to a very large class of mathematical statements, including all well-formed [[equations|algebraic statements]], and all statements written in modern computer programming languages.{{cite book | last1=Davis | first1=Martin | last2=Davis | first2=Martin D. | title=The Universal Computer | publisher=W. W. Norton & Company | date=2000 | isbn=978-0-393-04785-1 | page=}} [11] => [12] => Despite the widespread uptake of this definition, there are some mathematical concepts that have no well-defined characterisation under this definition. This includes [[the halting problem]] and [[busy beaver|the busy beaver game]]. It remains an open question as to whether there exists a more powerful definition of 'well-defined' that is able to capture both computable and 'non-computable' statements.The study of non-computable statements is the field of [[hypercomputation]].{{cite journal | author=Davis, Martin | title = Why there is no such discipline as hypercomputation | journal = Applied Mathematics and Computation | volume = 178 | issue = 1 | year = 2006 | pages = 4–7 | doi = 10.1016/j.amc.2005.09.066}} [13] => [14] => Some examples of mathematical statements that are computable include: [15] => * All statements characterised in modern programming languages, including [[C++]], [[Python (programming language)|Python]], and [[Java (programming language)|Java]]. [16] => * All calculations carried by an electronic [[computer]], [[calculator]] or [[abacus]]. [17] => * All calculations carried out on an [[analytical engine]]. [18] => * All calculations carried out on a [[Turing Machine]]. [19] => * The majority of mathematical statements and calculations given in maths textbooks. [20] => [21] => Some examples of mathematical statements that are ''not'' computable include: [22] => [23] => * Calculations or statements which are ill-defined, such that they cannot be unambiguously encoded into a Turing machine: ("Paul loves me twice as much as Joe"). [24] => * Problem statements which do appear to be well-defined, but for which it can be proved that no Turing machine exists to solve them (such as [[the halting problem]]). [25] => [26] => === The Physical process of computation === [27] => Computation can be seen as a purely physical process occurring inside a closed [[physical system]] called a [[computer]]. Turing's 1937 proof, ''[[On Computable Numbers, with an Application to the Entscheidungsproblem]]'', demonstrated that there is a formal equivalence between computable statements and particular physical systems, commonly called [[computers]]. Examples of such physical systems are: [[Turing machines]], human mathematicians following strict rules, [[digital computer]]s, [[mechanical computer]]s, [[analog computer]]s and others. [28] => [29] => == Alternative accounts of computation == [30] => [31] => === The mapping account === [32] => An alternative account of computation is found throughout the works of [[Hilary Putnam]] and others. [[Peter Godfrey-Smith]] has dubbed this the "simple mapping account."{{Citation|last=Godfrey-Smith|first=P.|year=2009|title=Triviality Arguments against Functionalism|journal=Philosophical Studies|volume=145|issue=2|pages=273–95|doi=10.1007/s11098-008-9231-3|s2cid=73619367 }} [[Gualtiero Piccinini|Gualtiero Piccinini's]] summary of this account states that a physical system can be said to perform a specific computation when there is a mapping between the state of that system and the computation such that the "microphysical states [of the system] mirror the state transitions between the computational states."{{cite book|last=Piccinini|first=Gualtiero|title=Physical Computation: A Mechanistic Account|place=Oxford|publisher=Oxford University Press|year=2015|page=18|isbn=9780199658855}} [33] => [34] => === The semantic account === [35] => Philosophers such as [[Jerry Fodor]]{{Citation | last = Fodor | first = J. A. | year = 1986 | title = The Mind-Body Problem | journal = Scientific American | volume = 244 | issue = January 1986}} have suggested various accounts of computation with the restriction that [[semantics|semantic]] content be a necessary condition for computation (that is, what differentiates an arbitrary physical system from a computing system is that the operands of the computation represent something). This notion attempts to prevent the logical abstraction of the mapping account of [[digital physics#Pancomputationalism or the computational universe theory|pancomputationalism]], the idea that everything can be said to be computing everything. [36] => [37] => === The mechanistic account === [38] => [[Gualtiero Piccinini]] proposes an account of computation based on [[mechanical philosophy]]. It states that physical computing systems are types of mechanisms that, by design, perform physical computation, or the manipulation (by a functional mechanism) of a "medium-independent" vehicle according to a rule. "Medium-independence" requires that the property can be instantiated{{clarify|date=February 2022}} by multiple realizers{{clarify|date=February 2022}} and multiple mechanisms, and that the inputs and outputs of the mechanism also be [[Multiple realizability|multiply realizable]]. In short, medium-independence allows for the use of physical variables with properties other than voltage (as in typical digital computers); this is imperative in considering other types of computation, such as that which occurs in the [[brain]] or in a [[quantum computer]]. A rule, in this sense, provides a mapping among inputs, outputs, and internal states of the physical computing system.{{cite book | last = Piccinini | first = Gualtiero | title = Physical Computation: A Mechanistic Account | place = Oxford | publisher = Oxford University Press | year = 2015 | page = 10 | isbn = 9780199658855}} [39] => [40] => == Mathematical models == [41] => {{Main|Model of computation}} [42] => In the [[theory of computation]], a diversity of mathematical models of computation has been developed. [43] => Typical mathematical [[Model of computation|models of computers]] are the following: [44] => * State models including [[Turing machine]], [[pushdown automaton]], [[finite state automaton]], and [[Parallel random access machine|PRAM]] [45] => * Functional models including [[lambda calculus]] [46] => * Logical models including [[logic programming]] [47] => * Concurrent models including [[actor model]] and [[process calculi]] [48] => Giunti calls the models studied by computation theory ''computational systems,'' and he argues that all of them are mathematical [[dynamical system]]s with discrete time and discrete state space.{{cite book|last=Giunti|first=Marco|title=Computation, Dynamics, and Cognition|place=New York|publisher=Oxford University Press|year=1997|isbn=978-0-19-509009-3}}{{rp|ch.1}} He maintains that a computational system is a complex object which consists of three parts. First, a mathematical dynamical system DS with discrete time and discrete state space; second, a computational setup H=\left(F, B_F\right), which is made up of a theoretical part F, and a real part B_F; third, an interpretation I_{DS,H}, which links the dynamical system DS with the setup H.{{Citation|last=Giunti|first=Marco|year=2017|title=What is a Physical Realization of a Computational System?|journal=Isonomia -- Epistemologica|volume=9|pages=177–92|issn=2037-4348|url=https://www.researchgate.net/publication/319631506}}{{rp|pp.179–80}} [49] => [50] => == See also == [51] => * [[Computability theory]] [52] => * [[Hypercomputation]] [53] => * [[Computational problem]] [54] => * [[Limits of computation]] [55] => * [[Computationalism]] [56] => [57] => == Notes == [58] => {{reflist|group=note}} [59] => [60] => == References == [61] => {{Reflist}} [62] => [63] => [[Category:Theoretical computer science]] [64] => [[Category:Computability theory]] [] => )
good wiki

Computation

Computation is the process of transforming data with the help of algorithms and mathematical models, resulting in useful information. It involves performing calculations, solving problems, and making decisions using computers and other devices.

More about us

About

It involves performing calculations, solving problems, and making decisions using computers and other devices. Computation is an essential aspect of various fields, including mathematics, computer science, physics, and engineering. This Wikipedia page provides a comprehensive overview of computation, covering its history, different types, processes, and applications. It also discusses the theoretical foundations of computation, such as Turing machines and computational complexity theory. Additionally, the page highlights the impact of computation in modern society, including advancements in artificial intelligence, machine learning, and data analysis.

Expert Team

Vivamus eget neque lacus. Pellentesque egauris ex.

Award winning agency

Lorem ipsum, dolor sit amet consectetur elitorceat .

10 Year Exp.

Pellen tesque eget, mauris lorem iupsum neque lacus.

You might be interested in

Abacus

An abacus is a counting tool that has been used for centuries in various parts of the world.

Arithmetic

Arithmetic is a branch of mathematics concerned with the study of numbers and their properties, operations, and relationships.

Brain

The brain is a complex organ that serves as the center of the nervous system in humans and many other animals.

C++

C++ is a general-purpose programming language that was developed in 1979 by Bjarne Stroustrup.

Computer

A computer is an electronic device that can perform various tasks based on programmed instructions.

Computers

equations

Godel

Semantics

Semantics is the study of meaning in language and communication.