The problem Uhing looked at involves a Turing machine, named for the late British mathematician
Alan M. Turing. A typical Turing machine can be represented as a device that reads and writes symbols on an infinite tape and has a control unit that can take on a finite number of states.