unrestricted access to unlimited memory
The Turing machine model uses an infinite tape as its unlimited memory.
It has a tape head that can read and write symbols and move both left and right on the tape.
The outputs accept and reject are obtained by entering designated accepting and rejecting states. If it doesn’t enter an accepting or a rejecting state, it will go on forever, never halting.