Define Turing machines (TM)

A Turing machine is a theoretical computational model that consists of an infinite tape, a tape head that reads and writes symbols, and a set of rules or states that determine its operations. It is used to simulate the logic of any computer algorithm, serving as a fundamental concept in the theory of computation and complexity.