Computational power of one-way Turing machines with sublogarithmic memory restrictions

DOI10.3103/S1066369X14090096zbMath1323.68272OpenAlexW1982159199MaRDI QIDQ2262923

A. N. Leshchev

Publication date: 17 March 2015

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x14090096

zbMATH Keywords

one-way Turing machinenondeterministic Turing machinememory restrictions

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Real-time computations with restricted nondeterminism
• Computational Complexity
• Real-Time Definable Languages
• Quasi-realtime languages
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational power of one-way Turing machines with sublogarithmic memory restrictions