Changes

m
Close parenthesis
Line 4: Line 4:  
[[File:Turing_Machine_finished.png|frame|Final state of Turing machine for simple addition showing result 5]]
 
[[File:Turing_Machine_finished.png|frame|Final state of Turing machine for simple addition showing result 5]]
   −
This is an example of a universal computer designed by [http://en.wikipedia.org/wiki/Alan_Turing Alan Turing] in order to investigate problems in computability. As far as we know ([http://en.wikipedia.org/wiki/Church-Turing_Thesis Church-Turing Thesis], any function that can be computed by an effective algorithm can be computed by a Turing Machine. A multitude of other systems has been proposed, and all are equivalent to the Turing Machine and to each other. However, there are [http://en.wikipedia.org/wiki/Entscheidungsproblem questions that we would like to ask] that neither a Turing Machine nor any of those other systems can answer.
+
This is an example of a universal computer designed by [http://en.wikipedia.org/wiki/Alan_Turing Alan Turing] in order to investigate problems in computability. As far as we know ([http://en.wikipedia.org/wiki/Church-Turing_Thesis Church-Turing Thesis]), any function that can be computed by an effective algorithm can be computed by a Turing Machine. A multitude of other systems has been proposed, and all are equivalent to the Turing Machine and to each other. However, there are [http://en.wikipedia.org/wiki/Entscheidungsproblem questions that we would like to ask] that neither a Turing Machine nor any of those other systems can answer.
    
Before we get to those undecidable questions, however, how is a Turing Machine constructed, and what is our Turing Machine going to do?
 
Before we get to those undecidable questions, however, how is a Turing Machine constructed, and what is our Turing Machine going to do?
1,009

edits