Ask
your own question, for FREE!
Computer Science
34 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
XShawtyX:
Helpud83dude4f All this graphing shi hurts my head like how tf do u do this????
Jasonisyours:
What were the key causes of the French Revolution in 1789?
brianagatica14:
A phone company charges $2 for the first five minutes of a phone call and 30 cents per minute thereafter.
PureSoulless:
Why is the word "Pedophile" always censored in yt vids?
CherryLover:
not sure if ya'll hear of this but last year there was this girl and her name is Aubreigh Wyatt and she was bullied by a group of people and they hated her
ctomk3743:
It's another song I had in mind (please no negative comments) I walk through the rain at night as the wind blows hard and the rain pours down on me.
1 hour ago
1 Reply
1 Medal
1 hour ago
2 Replies
4 Medals
29 minutes ago
5 Replies
3 Medals
23 hours ago
3 Replies
0 Medals
1 hour ago
41 Replies
3 Medals
1 day ago
8 Replies
7 Medals