We introduce a concept of real-time computation by a Turing machine. The relative strengths of one-tape versus two-tape machines is established by a new method of proofs of impossibility of actual computations.
KeywordsInput Sequence Turing Machine Recursive Function Finite Automaton Atomic Move
Unable to display preview. Download preview PDF.