For ten points, name this hypothetical  computing machine which became the basis for all subsequent digital  computers.
It was proposed to help answer an extension of Godel's  incompleteness theorem - does there exists a process by which one  could decide if a proposition is unprovable? As first envisaged,  it consists of a read/write head and scans a two-dimensional tape.  Based on this input, the machine then executes instructions based  on what state it's in. For ten points, name this hypothetical  computing machine which became the basis for all subsequent digital  computers.
It was proposed to help answer an extension of Godel's  incompleteness theorem - does there exists a process by which one  could decide if a proposition is unprovable?
{Turing} machine