Abstract :
We study the power of RAM acceptors with several instruction sets. We exhibit several instances where the availability of the division operator increases the power of the acceptors. We also show that in certain situations parallelism and stochastic features (´distributed random choices´) are provably more powerful than either parallelism or randomness alone. We relate the class of probabilistic Turing machine computations to random access machines with multiplication (but without boolean vector operations). Again, the availability of integer division seems to play a crucial role in these results.
Keywords :
Computational modeling; Concurrent computing; Distributed computing; Instruction sets; Magnetic heads; Parallel processing; Polynomials; Read-write memory; Stochastic processes; Turing machines;
Conference_Titel :
Foundations of Computer Science, 1979., 20th Annual Symposium on
Conference_Location :
San Juan, Puerto Rico
DOI :
10.1109/SFCS.1979.13