Ask
your own question, for FREE!
Computer Science
9 Online
Alan Turing said that with six primitives, anything could be discrbed in mechanical procces.Explain
Still Need Help?
Join the QuestionCove community and study together with friends!
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.
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!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
Subshilava:
Does anyone have recommendations for writing ur college essay I cannot think of a
Countless7Echos:
Ah trying out the whole T.V girl drawing :p (I love drawing eyes)
SnowyBreaks:
You ever get the types of dreams where it feels as if you aren't breathing? And w
laylasnii13:
Poem/diary i wrote I Want Out Iu2019m so tired of screaming into walls. Every fight with my mom leaves something broken and itu2019s not just plates or slam
Countless7Echos:
Aye.. I need actually some help on the shading here.. if the light is from above too I just feel something is off.
11 hours ago
0 Replies
0 Medals
12 hours ago
14 Replies
6 Medals
2 days ago
7 Replies
0 Medals
6 days ago
13 Replies
3 Medals
1 week ago
19 Replies
3 Medals