0
What year did Alan Turing prove that a stream of 1's and 0s could solve any problem?
Wiki User
∙ 7y agoWant this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
Who proved that a machine was capable of processing a stream of 1s and 0s was capable of solving any problem?
Alan Turing devised the Turing Machine which can be described as a robot which can look at one cell on an infinitely long tape of cells and then, based on what is in that cell and a given program either change the symbol in the cell and/or move the robot to look at the cell to the left/right of the current cell. Alan Turing then went on to prove that it was possible to write a program for this machine that could do the same as the program written for any other computing machine (it might take a very, very, very long time to do it but it would do it). However, some programs are impossible to write; for example it is impossible to write a program which will tell you if a program given to it as input will terminate or not (which Alan Turing proved); this is known as the halting problem.
How to prove an isosceles triangle with one angle bisector?
What have we got to prove? Whether we have to prove a triangle as an Isoseles triangle or prove a property of an isoseles triangle. Hey, do u go to ALHS, i had that same problem on my test today. Greenehornet15@yahoo.com
How could you prove that 57 and 111 are prime numbers?
ask yourself if anything can go into 57 or 111 (divided)
Prove that the shortest distance between two points is a straight line segment joining them?
This problem can be solved with the Calculus of Variations. Seehttp://en.wikipedia.org/wiki/Calculus_of_variations#The_Euler.E2.80.93Lagrange_equation
What is a synonym for validate?
A synonym for valid could be credible or legal.
What year did Alan Turing prove that a machine capable of processing a stream of 1s and 0s would be capable of solving any problem?
1942
Q.If a language is decidable and Turing recognizable then prove that it is also co Turing?
Turing Decidable Languages are both Turing Rec and Turing Co-Recognizable. If a Language is Not Turing Decidable, either it, or it's complement, must be not Recognizable.
Who proved that a machine was capable of processing a stream of 1s and 0s was capable of solving any problem?
Alan Turing devised the Turing Machine which can be described as a robot which can look at one cell on an infinitely long tape of cells and then, based on what is in that cell and a given program either change the symbol in the cell and/or move the robot to look at the cell to the left/right of the current cell. Alan Turing then went on to prove that it was possible to write a program for this machine that could do the same as the program written for any other computing machine (it might take a very, very, very long time to do it but it would do it). However, some programs are impossible to write; for example it is impossible to write a program which will tell you if a program given to it as input will terminate or not (which Alan Turing proved); this is known as the halting problem.
When did Alan turning prove that a machine processing a stream of 1s and 0s could solve any problem?
It was actually the other way around.In 1936 in his paper titled "On Computable Numbers" he proved that there were problems that such a machine could notsolve.
What does it mean for a computer to be general-purposeHow do we know or prove if a computer is capable of doing anything or to simulate all other (turing) machines?
To be available to everyon
When did Alan turning prove a machine capable of processinmg a stream of 1s?
45678
How will you prove the ic water and stream are the forms of single compound?
Chemical analysis determine that the chemical composition is identical.
To pass a literacy test a prospective voter had to prove he could?
The prospective voter had to prove he could read and write.
Can a urine sample prove alcohol consumption from a diabetic?
Yes. No problem.
Could you die if you have a penis that is 14 inches at 11 years old?
We all have to go sometime But I doubt if the length of your penis would have any bearing on it. !4 inches could prove to be a bit of a problem but it wont kill you.
What was the single fact that montag could not prove?
Montag could not prove that books were worth preserving and that society was better off with them.
How can you prove a printer problem is not with the printer?
One way would be to try the printer on another computer. You could also try removing and then reinstalling the printer. Also try updating the driver.
