On-Line Turing Machine Computations

DOI10.1109/PGEC.1966.264374MaRDI QIDQ5543055zbMATH OpenFDO

Authors D. R. Haring

Publication date 1966

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

Full work available at URL https://doi.org/10.1109/PGEC.1966.264374

zbMATH Keywords

numerical analysis

Cited in

(9)

• Complexity lower bounds for machine computing models
• 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
• The complexity of on-line simulations between multidimensional turing machines and random access machines

This page was built for publication: On-Line Turing Machine Computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5543055)