Combined hierarchies of finite random access machines

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.