Give a precise (mathematical) definition of a Turing machine (TM) and how its parts work together to solve problems. Perhaps, not surprisingly (maybe surprisingly?), this most powerful machine envisioned is also the most simple known. (Other methods of computation have been developed, but each have been shown to be equivalent in expressible power as Turing machines). What does does this statement mean?
