Ask your own question, for FREE!
Computer Science
OpenStudy (anonymous):

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

OpenStudy (anonymous):

Explain

OpenStudy (anonymous):

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.

OpenStudy (anonymous):

can u explain in a easire way

OpenStudy (anonymous):

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

OpenStudy (anonymous):

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

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!