Email this article On relationships between complexity classes of Turing machines
- Authors: Zakharov V.N.1, Kozmidiadi V.A.1
-
Affiliations:
- Federal Research Center Computer Science and Control
- Issue: Vol 57, No 4 (2017)
- Pages: 726-738
- Section: Article
- URL: https://journals.rcsi.science/0965-5425/article/view/179107
- DOI: https://doi.org/10.1134/S096554251704011X
- ID: 179107
Cite item
Open Access
Access granted
Subscription Access
Abstract
Classes of time and space complexity of Turing machines are defined, and relationships between them are discussed. New relationships between the defined complexity classes are described.
About the authors
V. N. Zakharov
Federal Research Center Computer Science and Control
Author for correspondence.
Email: VZakharov@ipiran.ru
Russian Federation, Moscow, 119333
V. A. Kozmidiadi
Federal Research Center Computer Science and Control
Email: VZakharov@ipiran.ru
Russian Federation, Moscow, 119333
Supplementary files
