Turing machine (nonfiction): Difference between revisions
No edit summary |
|||
| Line 1: | Line 1: | ||
[[File:TuringBeispielAnimatedGIF.gif|right|frame|Animated diagram of a Turing machine.]]A '''Turing machine''' is a hypothetical device that manipulates [[Symbol|symbols]] on a strip of tape according to a table of rules. | [[File:TuringBeispielAnimatedGIF.gif|right|frame|Animated diagram of a Turing machine.]]A '''Turing machine''' is a hypothetical device that manipulates [[Symbol|symbols]] on a strip of tape according to a table of rules. | ||
Despite its simplicity, a Turing machine can be adapted to simulate the [[logic (nonfiction)]] of any computer algorithm. | Despite its simplicity, a Turing machine can be adapted to simulate the [[logic (nonfiction)]] of any computer algorithm. | ||
| Line 16: | Line 14: | ||
[[Turing completeness (nonfiction)]] is the ability for a system of instructions to simulate a Turing machine. | [[Turing completeness (nonfiction)]] is the ability for a system of instructions to simulate a Turing machine. | ||
A [[programming language]] that is [[Turing complete]] is theoretically capable of expressing all tasks accomplishable by computers. | A [[programming language]] that is [[Turing complete]] is theoretically capable of expressing all tasks accomplishable by computers. | ||
Nearly all non-markup programming languages are Turing complete. | Nearly all non-markup programming languages are Turing complete. | ||
== In the News == | |||
<gallery mode="traditional"> | |||
</gallery> | |||
== Fiction cross-reference == | |||
* [[Alan Turing]] | |||
* [[Turing machine]] | |||
== Nonfiction cross-reference == | == Nonfiction cross-reference == | ||
| Line 31: | Line 37: | ||
* [[Turing completeness (nonfiction)]] | * [[Turing completeness (nonfiction)]] | ||
External links: | |||
* [https://en.wikipedia.org/wiki/Turing_machine Turing machine] @ Wikipedia | * [https://en.wikipedia.org/wiki/Turing_machine Turing machine] @ Wikipedia | ||
Revision as of 19:26, 24 June 2016
A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules.
Despite its simplicity, a Turing machine can be adapted to simulate the logic (nonfiction) of any computer algorithm.
At a very high level, the machine consists of a memory tape divided into cells.
A "head" (e.g. a pencil/eraser) traverses the memory one cell at a time, writing or erasing data (e.g. numerical digits) based on user-specified rules.
The "machine" was invented in 1936 by Alan Turing (nonfiction) who called it an "a-machine" (automatic machine).
The Turing machine is not intended as practical computing technology, but rather as a hypothetical device representing a computing machine.
Turing machines help computer scientists understand the limits of mechanical computation.
Turing completeness (nonfiction) is the ability for a system of instructions to simulate a Turing machine.
A programming language that is Turing complete is theoretically capable of expressing all tasks accomplishable by computers.
Nearly all non-markup programming languages are Turing complete.
In the News
Fiction cross-reference
Nonfiction cross-reference
- Alan Turing (nonfiction)
- Alonzo Church (nonfiction)
- Computer science (nonfiction)
- Mathematics (nonfiction)
- Turing completeness (nonfiction)
External links:
- Turing machine @ Wikipedia