On-Line Turing Machine Computations

DOI10.1109/PGEC.1966.264374zbMath0161.13504MaRDI QIDQ5543055

D. R. Haring

Publication date: 1966

Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)

zbMATH Keywords

numerical analysis

Related Items

The complexity of on-line simulations between multidimensional turing machines and random access machines, Kolmogoroff algorithms are stronger than Turing machines, Complexity of algorithms and computations, Time complexity of multidimensional Turing machines, Multiple threshold perceptron, Zwei-Band Simulation von Turingmaschinen. (Two-tape simulation of Turing machines), Tabulator-Turingmaschine und Komplexität. (Tabulator Turing machine and complexity), Berichtigung zu: Tabulator-Turingmaschinen und Komplexität, Complexity lower bounds for machine computing models