Ask your own question, for FREE!
Computer Science 9 Online
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!
Latest Questions
HeyItsAlicia: Why was questioncove not working??
2 hours ago 2 Replies 1 Medal
Countless7Echos: Ah trying out the whole T.V girl drawing :p (I love drawing eyes)
12 hours ago 14 Replies 6 Medals
kaelynw: starting to draw a hand
2 days ago 17 Replies 2 Medals
Twaylor: Rate it :D (Took 2 days)
6 days ago 7 Replies 0 Medals
XShawtyX: Art, Short Writing Assignment: Imagining Landscapes
2 days ago 9 Replies 1 Medal
XShawtyX: Chemistry, Help ud83dude4fud83cudffe
1 week ago 13 Replies 1 Medal
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!