answersLogoWhite

0


Want this question answered?

Be notified when an answer is posted

Add your answer:

Earn +20 pts
Q: Who proved that a machine capable of processing a stream of s and s what capable of solving any problem?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Who proved that a machine capable of processing a stream of s and s was capable of solving any problem?

There is no such thing as a machine "capable of solving any problem".


Who proved machine capable of processing a stream of 1s and 0s was capable of solving any problem?

davros


Who proved that a machine capable of processing a steam of s and s was capable of solving any problem?

alan turning


Who proved that a machine capable of processing a stream of 1st and os was capable of solving any problem?

who nose unless u were born in them times


Who proved that a machine capable of processing a stream 1's and 0s was capable of solving any problem?

That sounds like the description of a Turing machine, which was a theoretical machine described by Alan Turing.


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


Which pattern of neural processing is importante for higher level mental processing such as problem solving?

Parallel processing


Which pattern of neural processing is important for higher level mental processing such as problem solving?

parallel


What aspect of networking ensures that problem solving occurs quickly?

Distributed processing


What is the first step in the Seven military problem solving processing?

The first step in military problem solving is to successfully identify the problem. This step is also applicable to situations outside of the military.


What process do engineers use to design a new machine to solve a problem?

problem solving process


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.