Turing's Thesis: Computability and Algorithms
Classified in Computers
Written on in
English with a size of 2.5 KB
Turing's Thesis and the Problem of Computability
Thesis 1
"Every problem that can be solved algorithmically can be solved by a Turing machine."
Concepts Associated with Thesis 1
- Algorithm: A set of rules that can be mechanically applied to solve a problem of a given class. Mainly used in mathematical contexts.
- Calculation: Any transaction which is carried out by manipulation of symbols as a means of representation. The symbolic operations are atomic, that is, quite simple, and are held in a computer. The action of the computer will depend on the symbols that have the system and the internal state in which the computer is.
Thesis 2
"Every computable function can be computed by a Turing machine. Every problem that can be solved by algorithmic methods
... Continue reading "Turing's Thesis: Computability and Algorithms" »