Geodesic
Combined hierarchies of finite random access machines
Zapiski Nauchnykh Seminarov POMI, Computational complexity theory. Part VI, Tome 277 (2001), pp. 5-13 
A. P. Beltiukov. Combined hierarchies of finite random access machines. Zapiski Nauchnykh Seminarov POMI, Computational complexity theory. Part VI, Tome 277 (2001), pp. 5-13. http://geodesic.mathdoc.fr/item/ZNSL_2001_277_a0/
@article{ZNSL_2001_277_a0,
     author = {A. P. Beltiukov},
     title = {Combined hierarchies of finite random access machines},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {5--13},
     year = {2001},
     volume = {277},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2001_277_a0/}
}
TY  - JOUR
AU  - A. P. Beltiukov
TI  - Combined hierarchies of finite random access machines
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2001
SP  - 5
EP  - 13
VL  - 277
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2001_277_a0/
LA  - ru
ID  - ZNSL_2001_277_a0
ER  - 
%0 Journal Article
%A A. P. Beltiukov
%T Combined hierarchies of finite random access machines
%J Zapiski Nauchnykh Seminarov POMI
%D 2001
%P 5-13
%V 277
%U http://geodesic.mathdoc.fr/item/ZNSL_2001_277_a0/
%G ru
%F ZNSL_2001_277_a0

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

A finitary approach to the computational complexity theory is considered in the article. Classes of finite random access machines are investigated. Combined space-and-time computational complexity hierarchies of predicates (properties, sets) recognizable by these machines are built. The corresponding theorem is proved.