One method of analysis of turing computations. III

DOI10.1007/BF01071773MaRDI QIDQ3804681zbMATH OpenFDO

Authors V. A. Moshchenskij

Publication date 1987

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01071773

zbMATH Keywords

lower boundsone-tape Turing machine computationsthreadstime complexity

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A method of analyzing turing computations. II
• SOFSEM 2004: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 3997169
• scientific article; zbMATH DE number 4068851
• Theory of one-tape linear-time Turing machines

Cited in

(3)

• A method of analyzing turing computations. II
• scientific article; zbMATH DE number 6302782 (Why is no real title available?)
• SOFSEM 2004: Theory and Practice of Computer Science

This page was built for publication: One method of analysis of turing computations. III

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