Turing Machines

• Why is such a simple machine (model) of any importance?

• • It is widely accepted that anything that is intuitively computable can be computed by a Turing machine
  • If we can find a problem for which a Turing-machine solution can be proven not to exist, then the problem must be unsolvable