|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2014, Number 9, Pages 80–86
(Mi ivm8933)
|
|
|
|
Brief communications
Computational power of real-time Turing machines with sublogarithmic memory restrictions
A. N. Leshchev Chair of Theoretical Cybernetics, Kazan (Volga Region) Federal University, 18 Kremlyovskaya str., Kazan, 420008 Russia
Abstract:
In this paper we consider the well-known Turing machine model – nondeterministic real-time Turing machine. We prove the existence of nonregular complexity classes of languages that can be recognized by nondeterministic real-time Turing machines with sublogarithmic memory restrictions. These complexity classes form a strict hierarchy. We define a special language family and show its properties to prove that hierarchy.
Keywords:
real-time Turing machine, nondeterministic Turing machine, memory restrictions.
Citation:
A. N. Leshchev, “Computational power of real-time Turing machines with sublogarithmic memory restrictions”, Izv. Vyssh. Uchebn. Zaved. Mat., 2014, no. 9, 80–86; Russian Math. (Iz. VUZ), 58:9 (2014), 66–70
Linking options:
https://www.mathnet.ru/eng/ivm8933 https://www.mathnet.ru/eng/ivm/y2014/i9/p80
|
Statistics & downloads: |
Abstract page: | 172 | Full-text PDF : | 53 | References: | 46 | First page: | 13 |
|