Time Bounded Random Access Machines with Parallel Processing

Abstract

The RAM model of Cook and Reckhow is extended to allow parallel recursive calls andthe elementary theory of such machines is developed The uniform cost criterion is used The results include proofs of (!) the eqmvalence of nondetermmtsUc and deterministic polynomml Ume for such parallel machines and (2) the eqmvalence of polynomml tmae on such parallel machines and polynomml space on ordinary nonparallel RAM's Also included are results showing that parallelism appears to be stnctly more powerful than nondetermmlsm. © 1979, ACM. All rights reserved.