Alan Turing said that with six primitives, anything could be discrbed in mechanical procces.Explain
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.
can u explain in a easire way
Anything that can be described as a finite procedure (an algorithm) can be computed.
Join our real-time social learning platform and learn together with your friends!