Question

Alan Turing said that with six primitives, anything could be discrbed in mechanical procces.Explain

Answer 1

Explain

Answer 2

You must be watching the first lecture of MIT's 6.00 OCW series :-D

In computability theory, a system of data-manipulation rules (such as an instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if and only if it can be used to simulate any single-taped Turing machine and thus in principle any computer.

Answer 3

can u explain in a easire way

Answer 4

Anything that can be described as a finite procedure (an algorithm) can be computed.

Answer 5

http://www.youtube.com/watch?v=E3keLeMwfHY