Assembler languages which are machine specific/dependent and a readable version of the machine language.
Various levels of abstraction can be observed.
There is a machine independent focus for general purpose languages.
A Turing machine has an I/O tape (used for input, output and memory),
a PushDown Automaton (PDA -- a stack),
and a Finite State Machine (FSM)
understanding the class of context free languages (simple enough)
in which a program can be translated in linear time (proportional to program size)